Monophonic numbers of the join and composition of connected graphs

DOI10.1016/J.DISC.2006.08.002zbMATH Open1115.05028OpenAlexW2010606140MaRDI QIDQ870979FDOQ870979

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

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

zbMATH Keywords

monophonic set

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• The connected and forcing connected restrained monophonic numbers of a graph
• On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs
• Minimal connected restrained monophonic sets in graphs
• On the (M, D) number of a graph
• On the \(m\)-hull number of the join and composition of graphs.
• Connected monophonic domination in graphs
• Title not available (Why is that?)
• The forcing edge fixing edge-to-vertex monophonic number of a graph
• Extreme-support total monophonic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper triangle free detour number of a graph
• Closed monophonic and minimal closed monophonic numbers of a graph.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total and forcing total edge-to-vertex monophonic number of a graph
• Monophonic graphoidal covering number of corona product graphs
• 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)