On the edge monophonic number of a graph
From MaRDI portal
Publication:2856898
DOI10.2298/FIL1206081JzbMath1289.05048MaRDI QIDQ2856898
No author found.
Publication date: 30 October 2013
Published in: Filomat (Search for Journal in Brave)
Related Items (5)
STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS ⋮ Characterization of Upper Detour Monophonic Domination Number ⋮ On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs ⋮ THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH ⋮ The geodetic hop domination number of complementary prisms
This page was built for publication: On the edge monophonic number of a graph
