Abstract: For two vertices u and v in a connected graph G, the cyclic distance between them is defined as the minimum number of cycles to be traversed from a cycle containing u to a cycle containing v. This paper deals with a partition of the edges of a graph using cyclic distance, and discusses how to reduce a graph using this notion of distance and some properties of reduced graph of a graph.
|
Keywords and phrases: cyclic distance, cyclic edge partition, reduced graph of a graph.
Received: March 17, 2023; Revised: June 16, 2023; Accepted: July 1, 2023; Published: July 18, 2023
How to cite this article: Annie Sabitha Paul and K. K. Gireesan, Cyclic edge partition and reduced graph of a graph, Advances and Applications in Discrete Mathematics 40(1) (2023), 1-9. http://dx.doi.org/10.17654/0974165823053
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References: [1] Annie Sabitha Paul and Raji Pilakkat, Cycle neighbor polynomial of graphs, Communications in Mathematics and Applications 11(4) (2020), 549-558. DOI: 10.26713/cma.v11i4.1441 [2] Annie Sabitha Paul and Raji Pilakkat, Cyclic distance in graphs, South East Asian Journal of Mathematics and Mathematical Sciences 17(1) (2021), 245-256. [3] Annie Sabitha Paul and Raji Pilakkat, Modified cycle neighbor polynomial of graphs, Advances in Mathematics Scientific Journal 9(10) (2020), 8883-8889. DOI: org/10.37418/amsj.9.10.111 [4] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Elsevier, New York, 1976. [5] F. Buckley and F. Harary, Distance in Graphs, Addison Wesley, Redwood City, CA, 1990.
|