Edge geodetic self-decomposition in graphs-Reference-Cited by-同舟云学术

Edge geodetic self-decomposition in graphs

Published:2020-06-06 Issue:05 Volume:12 Page:2050064
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

John J.¹^ORCID,Stalin D.²

Affiliation:

1. Department of Mathematics, Government College of Engineering, Tirunelveli-627 007, India

2. Department of Mathematics, St. Alphonsa College of Arts and Science, Karungal 629 159, India

Abstract

Let [Formula: see text] be a simple connected graph of order [Formula: see text] and size [Formula: see text]. A decomposition of a graph [Formula: see text] is a collection of edge-disjoint subgraphs [Formula: see text] of [Formula: see text] such that every edge of [Formula: see text] belongs to exactly one [Formula: see text]. The decomposition [Formula: see text] of a connected graph [Formula: see text] is said to be an edge geodetic self-decomposition if [Formula: see text] for all [Formula: see text]. Some general properties satisfied by this concept are studied.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830920500640

Reference13 articles.

1. On The Edge Geodetic Number Of A Graph

2. Multidecompositions of line graphs of complete graphs

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The forcing geodetic global domination number of a graph;Discrete Mathematics, Algorithms and Applications;2023-03-28

2. Construction of an Energy-Efficient Detour Non-Split Dominating Set in燱SN;Computers, Materials & Continua;2022

3. Distinct edge geodetic decomposition in graphs;COMMUN COMB OPTIM;2021

4. The geodetic hop domination number of complementary prisms;Discrete Mathematics, Algorithms and Applications;2021-02-16

5. The edge geodetic self decomposition number of a graph;RAIRO - Operations Research;2021