On diameter of permutation graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199905)33:3<161::AID-NET1>3.0.CO;2-3" /><161::AID-NET1>3.0.CO;2-3 10.1002/(SICI)1097-0037(199905)33:3<161::AID-NET1>3.0.CO;2-3zbMath0923.05023OpenAlexW1979487908MaRDI QIDQ4254349

Weizhen Gu

Publication date: 29 June 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3<161::aid-net1>3.0.co;2-3

zbMATH Keywords

distancediametereccentricityradiuspermutation graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (9)

Distance and connectivity measures in permutation graphs ⋮ On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ The fractional metric dimension of permutation graphs ⋮ On restricted connectivities of permutation graphs ⋮ On the broadcast domination number of permutation graphs ⋮ Bipartite graphs are not universal fixers ⋮ Claw-free graphs are not universal fixers ⋮ On the geodetic number of permutation graphs

This page was built for publication: On diameter of permutation graphs