본문 바로가기
KERD
논문KCI 등재

Connected edge detour monophonic number of a graph

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Connected edge detour monophonic number of a graph

Abstract

Connected edge detour monophonic number of a graph

참고문헌 (11)

  1. F. Buckley, "Distance in Graphs" (1990), Addison-Wesley
  2. G. Chartrand, "On the geodetic number of a graph", Networks, 39(1), pp.1~6 (2002)
  3. F. Harary, "Graph Theory" (1969), Addison-Wesley
  4. F. Harary, "The Geodetic Number of a Graph", Math. Comput. Modeling, 17(11), pp.87~95 (1993)
  5. A.P. Santhakumaran, "Some Realisation Results on Edge Monophonic Number of a Graph, communicated"
  6. A.P. Santhakumaran, "Connected Edge Monophonic Number of a Graph", Proyecciones Journal of Mathematics
  7. A.P. Santhakumaran, "Monophonic distance in graphs, Dis- crete Mathematics", Algorithms and Applications, 3(2), pp.159~169 (2011)
  8. A.P. Santhakumaran, "A Note on Monophonic Distance in Graphs", Discrete Mathematics, Algorithms and Applications, 4(2) (2012)
  9. A.P. Santhakumaran, "Edge Detour Monophonic Number of a Graph", Proyecciones Journal of Mathematics, 32(2), pp.181~196 (2013)
  10. P. Titus, "The Detour Monophonic Number of a Graph", J. Combin. Math. Combin. Comput, 83, pp.179~188 (2013)
  11. P. Titus, "On the Detour Monophonic Number of a Graph", Ars Combinatoria

관련 논문AI추천

이 간행물의 다른 논문 (14건)