The \(\mathscr{G}\)-average of adjacency and Laplacian polynomials of a graph

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...

Descrición completa

Detalles Bibliográficos

Principais autores:	Yaoping Hou, Wenjun Xie
Formato:	Artigo
Idioma:	Inglês
Publicado:	American Journal of Combinatorics 2025-12-01
Series:	The American Journal of Combinatorics
Assuntos:	\(\mathscr{G}\)-average of adjacency polynomial \(\mathscr{G}\)-average of Laplacian polynomial Quaternion unit gain graph Matching polynomial Weighted TU-subgraph polynomial
Acceso en liña:	https://ajcombinatorics.org/ojs/index.php/AmJC/article/view/28
Tags:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!