On diameter of permutation graphs
From MaRDI portal
Recommendations
Cited in
(15)- Distance and connectivity measures in permutation graphs
- The fractional metric dimension of permutation graphs
- On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees
- On the broadcast domination number of permutation graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- (G₁, G₂)-permutation graphs
- scientific article; zbMATH DE number 3855165 (Why is no real title available?)
- scientific article; zbMATH DE number 1151848 (Why is no real title available?)
- scientific article; zbMATH DE number 1151857 (Why is no real title available?)
- On restricted connectivities of permutation graphs
- On metric dimension of permutation graphs
- On the geodetic number of permutation graphs
- The diameter of Hanoi graphs
- Bipartite graphs are not universal fixers
- Claw-free graphs are not universal fixers
This page was built for publication: On diameter of permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254349)