On the classification and toughness of generalized permutation star-graphs

DOI10.1023/A:1022455216281zbMath0898.05033MaRDI QIDQ4209993

No author found.

Publication date: 28 September 1998

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30374

zbMATH Keywords

star graphtoughness of a graphgeneralized permutation graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (1)

On the Toughness of Cycle Permutation Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cycle permutation graphs
• On natural isomorphisms of cycle permutation graphs
• Tough graphs and Hamiltonian circuits.
• Die Gruppe des Petersenschen Graphen und der Kantensysteme der regulären Polyeder
• On Groups and Graphs
• On the Classification of Symmetric Graphs with a Prime Number of Vertices

This page was built for publication: On the classification and toughness of generalized permutation star-graphs