Permutations représentatives d'un graphe à seuil

DOI10.1016/0012-365X(84)90039-6MaRDI QIDQ795850zbMATH OpenFDO

Authors P. Arbouz

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(84)90039-6

zbMATH Keywords

permutation graphthreshold graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Graph theory (05C99)

Review text

It is known that, if G is a threshold graph, then G is also a permutation graph. In this article the author gives a way of getting all representative permutations of G and an explicit counting formula of all these permutations.

Recommendations

• Double-threshold permutation graphs
• Counting Labeled Threshold Graphs with Eulerian Numbers
• On Universal Threshold Graphs
• Oriented threshold graphs
• Threshold dimension of split-permutation graphs

Cited in

(1)

• Double-threshold permutation graphs

This page was built for publication: Permutations représentatives d'un graphe à seuil

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795850)