Monophonic numbers of the join and composition of connected graphs

DOI10.1016/j.disc.2006.08.002zbMath1115.05028OpenAlexW2010606140MaRDI QIDQ870979

Esamel M. Paluga, Sergio R. jun. Canoy

Publication date: 15 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.08.002

zbMATH Keywords

monophonic set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (14)

Upper triangle free detour number of a graph ⋮ Extreme-support total monophonic graphs ⋮ Total and forcing total edge-to-vertex monophonic number of a graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the (M, D) number of a graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs ⋮ Connected monophonic domination in graphs ⋮ Minimal connected restrained monophonic sets in graphs ⋮ THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH ⋮ The forcing total monophonic number of a graph

Cites Work

• Parallel concepts in graph theory
• On the Steiner, geodetic and hull numbers of graphs
• Comment on ``The Steiner number of a graph by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54]
• On the geodetic number of a graph
• Geodetic sets in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monophonic numbers of the join and composition of connected graphs