Distance and connectivity measures in permutation graphs

DOI10.1016/S0012-365X(02)00870-1zbMath1022.05024OpenAlexW2128673343MaRDI QIDQ1408867

Wayne Goddard, Peter J. Slater, Michael E. Raines

Publication date: 25 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00870-1

zbMATH Keywords

connectivitygeneralized prismpermutation graphaugmenting

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (14)

Edge-connectivity of permutation hypergraphs ⋮ On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees ⋮ Connectivity of strong products of graphs ⋮ On average connectivity of the strong product of graphs ⋮ Reliability of interconnection networks modeled by Cartesian product digraphs ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Connectivity measures in matched sum graphs ⋮ Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph ⋮ On restricted connectivities of permutation graphs ⋮ Bipartite graphs are not universal fixers ⋮ Claw-free graphs are not universal fixers ⋮ On the geodetic number of permutation graphs ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Highly connected star product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of generalized prisms over G
• Large survivable nets and the generalized prisms
• On diameter of permutation graphs
• Edge-Connectivity Augmentation with Partition Constraints

This page was built for publication: Distance and connectivity measures in permutation graphs