The forcing vertex detour monophonic number of a graph

DOI10.1016/J.AKCEJ.2016.03.002zbMath1346.05051OpenAlexW2323459946MaRDI QIDQ322058

P. Titus, P. V. Sundar Balakrishnan

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.03.002

zbMATH Keywords

detour monophonic pathforcing vertex detour monophonic numbervertex detour monophonic number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (2)

The connected vertex detour monophonic number of a graph ⋮ The forcing vertex detour monophonic number of a graph

Cites Work

• The forcing vertex detour monophonic number of a graph
• The geodetic number of a graph
• Parallel concepts in graph theory
• On the geodetic number of a graph
• MONOPHONIC DISTANCE IN GRAPHS
• A NOTE ON "MONOPHONIC DISTANCE IN GRAPHS"
• The graph reconstruction number
• The forcing geodetic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The forcing vertex detour monophonic number of a graph