EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Energy of Signed Total Graphs

Pranjali, Manish Kumar Saini

Boletim da Sociedade Paranaense de Matemática · 29.10.2026 · 44 (14) · 1-10

DOI: 10.5269/bspm.85958 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 29.10.2026. Verfasst von Pranjali und 1 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let $G$ be a simple graph, and let $\Sigma=(G,\sigma)$ denote a signed graph in which $\sigma$ applies a specific sign to every edge within $G$. A \emph{signed total graph} is as an ordered pair $T_{\Sigma}(\Gamma (R)) : = (T(\Gamma(R)),~ \sigma)$, in which $T(\Gamma(R)$ denotes the total graph corresponding to a commutative ring $R$. Furthermore, for any given edge $(a, b)$ within $T_{\Sigma}(\Gamma (R))$, the mapping $\sigma$ assign a positive sign to edge when at least one of the end vertices is zero-divisor of $R,$ whereas edges linking elements that are not zero-divisors are given a negative sign. Throughout this study, we calculate the energy of signed total graphs $T_\Sigma(\Gamma(R))$ obtained from a finite commutative ring $R$. More specifically, the comparison between the energy of signed total graph with total graph has been done.

Zitieren

APA

Pranjali, & Saini, M. K. (2026). Energy of Signed Total Graphs. Boletim da Sociedade Paranaense de Matemática, 44(14), 1-10. https://doi.org/10.5269/bspm.85958

Vancouver

Pranjali, Saini MK. Energy of Signed Total Graphs. Boletim da Sociedade Paranaense de Matemática. 2026;44(14):1-10. doi:10.5269/bspm.85958

BibTeX
@article{Pranjali2026,
  author = {Pranjali and Saini, Manish Kumar},
  title = {Energy of Signed Total Graphs},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2026},
  volume = {44},
  number = {14},
  pages = {1--10},
  doi = {10.5269/bspm.85958}
}
Kostenlos starten →