POLYNOMIAL REPRESENTATION OF EDGE GEODETIC CLOSURES IN GRAPHS
Keywords:
geodetic set, geodetic closure polynomialDOI:
https://doi.org/10.17654/0974165825034Abstract
In this study, we introduced a variant of geodetic sets which are generated by pairs of vertices and established some of its properties. For classes of path graphs, we have shown that the edge geodetic closure polynomial can be expressed in terms of a polynomial and its derivative.
Received: March 24, 2025
Revised: May 22, 2025;
Accepted: May 26, 2025
References
B. H. Arriola, S. A. Arriola, B. J. Amiruddin-Rajik and S. U. Sappayani, Independence-preserving operations: effects in polynomial representations, International Journal of Mathematics and Computer Science 20(1) (2025), 49-52. https://doi.org/10.69793/ijmcs/01.2025/bayah.
J. Ellis-Monaghan and J. Merino, Graph Polynomials and their Applications II: Interrelations and Interpretations, Birkhauser, Boston, 2011.
F. Harary, Graph Theory, CRC Press, Boca Raton, 2018.
J. I. Brown and R. J. Nowakowski, The neighbourhood polynomial of a graph, Australian Journal of Combinatorics 42 (2008), 55-68.
C. Hoede and X. Li, Clique polynomials and independent set polynomials of graphs, Discrete Math. 125 (1994), 219-228.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA

This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________
Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.
Contact Pushpa Publishing House for more info or permissions.
Journal Impact Factor: 