The \(\mathscr{G}\)-average of adjacency and Laplacian polynomials of a graph
American Journal of Combinatorics · 2025
DOI: 10.63151/amjc.v4i.28 ↗Kurz gefasst
Fachartikel in der Zeitschrift American Journal of Combinatorics, 2025. Verfasst von Yaoping Hou und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Let \(\mathscr{G}\) be a finite multiplicative group of quaternion unit \(U(\mathbb{H})\). The \(\mathscr{G}\)-average of adjacency (resp., Laplacian) polynomial of a graph \(G\) is defined as the arithmetic mean of the characteristic polynomials of adjacency (resp., Laplacian) matrice of all \(\mathscr{G}\)-gain graphs on \(G\). In this paper, we prove that the \(\mathscr{G}\)-average adjacency (resp., Laplacian) polynomial of a graph for any non-trivial finite subgroup \(\mathscr{G}\) of \(U(\mathbb{H})\) coincides with its matching (resp., weighted TU-subgraph) polynomial, which generalizes previous findings for signed graphs.
Zitieren
APA
Hou, Y., & Xie, W. (2025). The \(\mathscr{G}\)-average of adjacency and Laplacian polynomials of a graph. American Journal of Combinatorics. https://doi.org/10.63151/amjc.v4i.28
Vancouver
Hou Y, Xie W. The \(\mathscr{G}\)-average of adjacency and Laplacian polynomials of a graph. American Journal of Combinatorics. 2025. doi:10.63151/amjc.v4i.28
BibTeX
@article{Hou2025,
author = {Hou, Yaoping and Xie, Wenjun},
title = {The \(\mathscrG\)-average of adjacency and Laplacian polynomials of a graph},
journal = {American Journal of Combinatorics},
year = {2025},
doi = {10.63151/amjc.v4i.28}
}
EUVIMED