Closed monophonic and minimal closed monophonic numbers of a graph.

MaRDI QIDQ4649966zbMATH OpenFDO

Authors Ferdinand P. Jamil, S. R. Canoy, Salma N. Marohombsar

Publication date 15 November 2012

zbMATH Keywords

\(m\)-diameterminimal closed monophonic setmonophonic path

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• The connected monophonic number of a graph
• Monophonic numbers of the join and composition of connected graphs
• The upper open monophonic number of a graph
• The monophonic number of Cartesian product graphs
• The connected vertex monophonic number of a graph

Cited in

(4)

• A note on monophonic distance in graphs
• scientific article; zbMATH DE number 7511520 (Why is no real title available?)
• scientific article; zbMATH DE number 7722331 (Why is no real title available?)
• Monophonic numbers of the join and composition of connected graphs

This page was built for publication: Closed monophonic and minimal closed monophonic numbers of a graph.

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