EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

A-polynomial for some family of caveman graphs

Harishchandra Ramane, Daneshwari Patil

Annals of Mathematics and Computer Science · 2023

DOI: 10.56947/amcs.v18.196 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Annals of Mathematics and Computer Science, 2023. Verfasst von Harishchandra Ramane und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The caveman graph is a graph formed by modifying a set of isolated k-cliques (or caves) by removing one edge from each clique and using it to connect to a neighboring clique along a central cycle such that all n cliques form a single unbroken loop. Caveman graph containing n-copies of k-cliques is denoted as, (n,k)-caveman graph. For a graph G, the A-matrix is defined as, A(G)=[aij] in which aij=1 if vertices vi and vj are adjacent; and 0 otherwise. The polynomial associated with A-matrix is the A-polynomial. In this work, we study A-polynomial for some family of caveman graphs.

Zitieren

APA

Ramane, H., & Patil, D. (2023). A-polynomial for some family of caveman graphs. Annals of Mathematics and Computer Science. https://doi.org/10.56947/amcs.v18.196

Vancouver

Ramane H, Patil D. A-polynomial for some family of caveman graphs. Annals of Mathematics and Computer Science. 2023. doi:10.56947/amcs.v18.196

BibTeX
@article{Ramane2023,
  author = {Ramane, Harishchandra and Patil, Daneshwari},
  title = {A-polynomial for some family of caveman graphs},
  journal = {Annals of Mathematics and Computer Science},
  year = {2023},
  doi = {10.56947/amcs.v18.196}
}
Kostenlos starten →