Forcing edge detour monophonic number of a graph

DOI10.22108/TOC.2021.119182.1670MaRDI QIDQ4958097zbMATHOpenAlexFDO

Authors P. Titus, K. Ganesamoorthy

Publication date 6 September 2021

Full work available at URL https://doaj.org/article/a4e960d242384c7e9003087a65bb6a0f

zbMATH Keywords

edge detour monophonic numberedge detour monophonic setforcing edge detour monophonic numberforcing edge detour monophonic set

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Edge detour monophonic number of a graph
• Total and forcing total edge-to-vertex monophonic number of a graph
• The forcing edge monophonic number of a graph
• The forcing vertex detour monophonic number of a graph
• Forcing total detour monophonic sets in a graph

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Edge detour monophonic number of a graph
• On the detour monophonic number of a graph.
• The detour monophonic number of a graph

Cited in

(8)

• The forcing edge monophonic number of a graph
• scientific article; zbMATH DE number 5888298 (Why is no real title available?)
• scientific article; zbMATH DE number 5863463 (Why is no real title available?)
• The forcing edge covering number of a graph
• Edge detour monophonic number of a graph
• The forcing edge fixing edge-to-vertex monophonic number of a graph
• The forcing vertex detour monophonic number of a graph
• Forcing total detour monophonic sets in a graph

This page was built for publication: Forcing edge detour monophonic number of a graph

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