On the geodetic number of permutation graphs
DOI10.1007/S12190-014-0755-8zbMATH Open1297.05064OpenAlexW2020205743MaRDI QIDQ741406FDOQ741406
Authors: Eunjeong Yi 
Publication date: 12 September 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-014-0755-8
Recommendations
Permutations, words, matrices (05A05) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Connectivity (05C40) Extremal combinatorics (05D99)
Cites Work
- On the geodetic number of a graph
- Title not available (Why is that?)
- On restricted connectivities of permutation graphs
- The geodetic number of a graph
- On dominating the Cartesian product of a graph and K2
- Title not available (Why is that?)
- On the geodetic number and related metric sets in Cartesian product graphs
- Distance and connectivity measures in permutation graphs
- On diameter of permutation graphs
- On metric dimension of permutation graphs
- Title not available (Why is that?)
- Connectivity of generalized prisms over G
- On cycle permutation graphs
- Large survivable nets and the generalized prisms
- The lower and upper forcing geodetic numbers of complete \(n\)-partite graphs, \(n\)-dimensional meshes and tori
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the domination number of prisms of graphs
- Title not available (Why is that?)
- Domination of generalized Cartesian products
Cited In (1)
This page was built for publication: On the geodetic number of permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741406)
