EUVIMEDEUVIMED entdecken
Crossref

The nullity of the net Laplacian matrix of a signed graph

Zhuang Xiong

American Journal of Combinatorics · 2024

DOI: 10.63151/amjc.v3i.15 ↗

Kurz gefasst

Fachartikel in der Zeitschrift American Journal of Combinatorics, 2024. Verfasst von Zhuang Xiong.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The net Laplacian matrix of a signed graph \(\Gamma = (G, \sigma)\), where \(G = (V(G),E(G))\) is an unsigned graph (referred to as the underlying graph) and \(\sigma: E(G) \rightarrow \{-1, +1\}\) is the sign function, is defined as \(L^{\pm}(\Gamma) = D^{\pm}(\Gamma) - A(\Gamma)\). Here, \(D^{\pm}(\Gamma)\) and \(A(\Gamma)\) represent the diagonal matrix of net-degrees and the adjacency matrix of \(\Gamma\), respectively. The nullity of \(L^{\pm}(\Gamma)\), denoted as \(\eta (L^{\pm} (\Gamma))\), refers to the multiplicity of \(0\) as an eigenvalue of \(L^{\pm}(\Gamma)\). In this paper, we concentrate on the nullity of the net Laplacian matrix of a connected signed graph \(\Gamma\), and establish that \(1 \leq \eta (L^{\pm} (\Gamma)) \leq \min\{ \beta(\Gamma) + 1, |V(\Gamma)| - 1 \}\), where \(\beta(\Gamma) = |E(\Gamma)| - |V(\Gamma)| + 1\) denotes the cyclomatic number of \(\Gamma\). We completely determine the connected signed graphs with nullity \(|V(\Gamma)| - 1\). Additionally, we characterize the signed cactus graphs with nullity \(1\) or \(\beta(\Gamma) + 1\).

Zitieren

APA

Xiong, Z. (2024). The nullity of the net Laplacian matrix of a signed graph. American Journal of Combinatorics. https://doi.org/10.63151/amjc.v3i.15

Vancouver

Xiong Z. The nullity of the net Laplacian matrix of a signed graph. American Journal of Combinatorics. 2024. doi:10.63151/amjc.v3i.15

BibTeX
@article{Xiong2024,
  author = {Xiong, Zhuang},
  title = {The nullity of the net Laplacian matrix of a signed graph},
  journal = {American Journal of Combinatorics},
  year = {2024},
  doi = {10.63151/amjc.v3i.15}
}
Kostenlos starten →