Upper edge-to-vertex detour monophonic number of a graph

zbMATH Open1351.05067MaRDI QIDQ2825909FDOQ2825909

Authors: P. Titus, K. Ganesamoorthy, A. P. Santhakumaran 

Publication date: 13 October 2016

Published in: Advanced Studies in Contemporary Mathematics (Kyungshang) (Search for Journal in Brave)

zbMATH Keywords

monophonic pathedge-to-vertex detour monophonic set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38)

Cited In (7)

• Upper double monophonic number of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper detour monophonic number of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper triangle free detour number of a graph

This page was built for publication: Upper edge-to-vertex 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 Q2825909)