Search arXivSearch

arXiv · 2504.17553

Substructure Analysis and Cycle Enumeration Methods for Oriented Graphs Based on Parameterizing Hermitian Laplacian Matrices by Galois Conjugates

Abstract

This paper investigates the principal minors of a parameterized Hermitian Laplacian matrix for oriented graphs. Particularly, we focus on the properties of the matrix for parameters chosen as Galois conjugates of a primitive $p$th root of unity, where $p$ is an odd prime. We demonstrate that under this condition, the product of the corresponding Hermitian Laplacian determinants is an integer power of $p$. This algebraic property forms the basis for a method to enumerate non-vanishing unicyclic graph components within certain substructures. The study is situated within a framework where a variable unit-modulus complex parameter is introduced into the Hermitian Laplacian matrix, which also allows for an examination of relationships among principal minors under different parameters. Our analysis adopts the concept of substructures, defined as vertex-edge pairs $(V',E')$ where edges in $E'$ are not restricted to connecting vertices within $V'$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Silin Huang. 2025-07-10. Substructure Analysis and Cycle Enumeration Methods for Oriented Graphs Based on Parameterizing Hermitian Laplacian Matrices by Galois Conjugates. https://arxiv.org/abs/2504.17553

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO