On the geodetic number of permutation graphs

DOI10.1007/s12190-014-0755-8zbMath1297.05064OpenAlexW2020205743MaRDI QIDQ741406

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

zbMATH Keywords

cyclegeodetic numbergeneralized prismpermutation graphcomplete \(k\)-partite graph

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Extremal combinatorics (05D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On metric dimension of permutation graphs
• On cycle permutation graphs
• Connectivity of generalized prisms over G
• Domination of generalized Cartesian products
• On the geodetic number and related metric sets in Cartesian product graphs
• The geodetic number of a graph
• Distance and connectivity measures in permutation graphs
• Large survivable nets and the generalized prisms
• On the geodetic number of a graph
• The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori
• On diameter of permutation graphs
• On dominating the Cartesian product of a graph and K₂
• On the domination number of prisms of graphs
• On restricted connectivities of permutation graphs

This page was built for publication: On the geodetic number of permutation graphs