지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 장전수학회 Advanced Studies in Contemporary Mathematics Advanced Studies in Contemporary Mathematics Vol.26 No.2
- 발행연도
- 2016.1
- 수록면
- 371 - 378 (8page)
이용수
초록· 키워드
오류제보하기
For a connected graph G = (V,E) of order at least three, the monophonic distance dm(u, v) is the length of a longest u−v monophonic path in G. A u − v path of length dm(u, v) is called a u − v detour monophonic. For subsets A and B of V , the monophonic distance dm(A,B) is defined as dm(A,B) = min｛dm(x, y) : x ∈ A, y ∈ B｝. A u−v path of length dm(A, B) is called an A−B detour monophonic path joining the sets A,B ⊆ V, where u ∈ A and v ∈ B. A set S ⊆ E is called an edge-to-vertex detour monophonic set of G if every vertex of G is incident with an edge of S or lies on a detour monophonic path joining a pair of edges of S. The edge-to-vertex detour monophonic number dmev(G) of G is the minimum cardinality of its edge-to-vertex detour monophonic sets and any edge-to-vertex detour monophonic set of car- dinality dmev(G) is an edge-to-vertex detour monophonic basis of G. An edge-to-vertex detour monophonic set S in a connected graph G is called a minimal edge-to-vertex detour monophonic set of G if no proper subset of S is an edge-to-vertex detour monophonic set of G. The upper edge-to-vertex detour monophonic number dm+ ev(G) of G is the maxi- mum cardinality of a minimal edge-to-vertex detour monophonic set of G. We determine bounds for it and certain general properties of these concepts are studied. It is shown that for every pair a, b of integers with 2 ≤ a ≤ b, there exists a connected graph G with dmev(G) = a and dm+ ev(G) = b.
목차
등록된 정보가 없습니다.
참고문헌 (7)
참고문헌 신청
F. Buckley / 1990 / Distance in Graphs / Addison-Wesley
F. Harary / 1969 / Graph Theory / Addison-Wesley
A.P. Santhakumaran / 2011 / Monophonic distance in graphs, Discrete Mathe-matics / Algorithms and Applications 3(2):159~169
A. P. SANTHAKUMARAN / 2012 / A NOTE ON "MONOPHONIC DISTANCE IN GRAPHS" / Discrete Mathematics, Algorithms and Applications 04(02):1250018
A.P. Santhakumaran / 2014 / Edge-to-Vertex Detour Monophonic Number of a Graph / Romanian Journal of Mathematics and Computer Science 4(1):180~188
F. Harary / 1969 / Graph Theory / Addison-Wesley
A.P. Santhakumaran / 2011 / Monophonic distance in graphs, Discrete Mathe-matics / Algorithms and Applications 3(2):159~169
A. P. SANTHAKUMARAN / 2012 / A NOTE ON "MONOPHONIC DISTANCE IN GRAPHS" / Discrete Mathematics, Algorithms and Applications 04(02):1250018
A.P. Santhakumaran / 2014 / Edge-to-Vertex Detour Monophonic Number of a Graph / Romanian Journal of Mathematics and Computer Science 4(1):180~188
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
RESOLUTION OF UNMIXED BIPARTITE GRAPHS
대한수학회보
2015 .01
-
Irregular labeling on transportation network of splitting star graphs
Proceedings of the Jangjeon Mathematical Society
2019 .01
-
Entire Zagreb index of vertex and edge F-join of graphs
Proceedings of the Jangjeon Mathematical Society
2020 .01
-
Double vertex-edge domination in trees
대한수학회보
2022 .01
-
Comparison between Detouring MJO and Non-Detouring MJO over the Maritime Continent
한국기상학회 학술대회 논문집
2017 .10
-
On the Metric Dimension of Corona Product of a Graph with K1
Kyungpook Mathematical Journal
2023 .03
-
The minimum vertex-block dominating energy of the graph
Proceedings of the Jangjeon Mathematical Society
2019 .01
-
The outer-connected vertex edge domination number of a tree
대한수학회논문집
2018 .01
-
The vertex degree polynomial of some graph operations
Proceedings of the Jangjeon Mathematical Society
2023 .01
-
SOME INEQUALITIES FOR THE HARMONIC TOPOLOGICAL INDEX
Journal of applied mathematics & informatics
2018 .01
-
Embedding distance graphs in finite field vector spaces
대한수학회지
2019 .01
-
Sharp conditions for the existence of an even $[a,b]$-factor in a graph
대한수학회보
2021 .01
-
LABEL INCIDENCE ENERGY OF PARTIAL EDGE LABELED GRAPH
Proceedings of the Jangjeon Mathematical Society
2021 .01
-
Refined enumeration of vertices among all rooted ordered $d$-trees
대한수학회보
2019 .01
-
Distance-Regular Graphs with Valency k, Diameter D≥3 and at Most Dk+1 Vertices
Kyungpook Mathematical Journal
2024 .09
-
Pick two points in a tree
대한수학회지
2019 .01
-
EXTREMAL F-INDICES FOR BICYCLIC GRAPHS WITH k PENDANT VERTICES
순수 및 응용수학
2020 .01
-
STRESS INDICES OF GRAPHS
Advanced Studies in Contemporary Mathematics
2021 .04
-
On pathos block line cut-vertex graph of a tree
대한수학회논문집
2020 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0