EUVIMEDEUVIMED entdecken
Crossref

Some analysis on the geodesic polynomial of graphs and its vertex

Bijayani Pattanaik, Amiya Kumar Behera

Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (6) · 2251-2259

DOI: 10.47974/jdmsc-2404 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von Bijayani Pattanaik und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A graph geodesic polynomial is an algebraic expression linked with its polynomial that gathers information about geodesics, which means shortest paths in a graph connecting two vertices. Examining these polynomials’ characteristics and behaviors, and how they interact with the underlying network, graph structure is necessary for researching the geodesic polynomials of graphs and their vertices. In this paper, we present geodesic polynomials for fan graphs, merging of two star graphs, hericyclic graphs formed by attaching n edges at one or all vertices of C3, Helm graph and geodesic polynomial at a vertex for star graphs and the extended star graphs.

Zitieren

APA

Pattanaik, B., & Behera, A. K. (2026). Some analysis on the geodesic polynomial of graphs and its vertex. Journal of Discrete Mathematical Sciences & Cryptography, 29(6), 2251-2259. https://doi.org/10.47974/jdmsc-2404

Vancouver

Pattanaik B, Behera AK. Some analysis on the geodesic polynomial of graphs and its vertex. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(6):2251-2259. doi:10.47974/jdmsc-2404

BibTeX
@article{Pattanaik2026,
  author = {Pattanaik, Bijayani and Behera, Amiya Kumar},
  title = {Some analysis on the geodesic polynomial of graphs and its vertex},
  journal = {Journal of Discrete Mathematical Sciences & Cryptography},
  year = {2026},
  volume = {29},
  number = {6},
  pages = {2251--2259},
  doi = {10.47974/jdmsc-2404}
}
Kostenlos starten →