Monophonic numbers of the join and composition of connected graphs

DOI10.1016/J.DISC.2006.08.002MaRDI QIDQ870979zbMATHOpenAlexFDO

Authors Esamel M. Paluga, S. R. 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)

Recommendations

• On the monophonic number of a graph
• Closed monophonic and minimal closed monophonic numbers of a graph.
• The connected monophonic number of a graph
• On the \(m\)-hull number of the join and composition of graphs.
• The monophonic number of Cartesian product graphs

Cites work

• scientific article; zbMATH DE number 2076931 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• Comment on ``The Steiner number of a graph by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54]
• Geodetic sets in graphs
• Minimal path convexity under some graph operations
• On the Steiner, geodetic and hull numbers of graphs
• On the geodetic covers and geodetic bases of the composition \(G[K_m]\).
• On the geodetic number of a graph
• Parallel concepts in graph theory

Cited in

(19)

• Extreme-support total monophonic graphs
• On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs
• Connected monophonic domination in graphs
• scientific article; zbMATH DE number 7641207 (Why is no real title available?)
• On the \((M, D)\) number of a graph
• Extreme outer connected monophonic graphs
• Total and forcing total edge-to-vertex monophonic number of a graph
• Monophonic graphoidal covering number of corona product graphs
• Minimal connected restrained monophonic sets in graphs
• Further results on the outer connected monophonic number of a graph
• scientific article; zbMATH DE number 7739488 (Why is no real title available?)
• Upper triangle free detour number of a graph
• Monophonic and geodetic dominations in the join, corona and composition of graphs
• The connected and forcing connected restrained monophonic numbers of a graph
• Closed monophonic and minimal closed monophonic numbers of a graph.
• The forcing edge fixing edge-to-vertex monophonic number of a graph
• On the \(m\)-hull number of the join and composition of graphs.
• On the complement connected Steiner number of a graph
• The forcing total monophonic number of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870979)