Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 78 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 120 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 459 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Matrix tree theorem for the net Laplacian matrix of a signed graph (2210.03711v2)

Published 7 Oct 2022 in math.CO

Abstract: For a simple signed graph $G$ with the adjacency matrix $A$ and net degree matrix $D{\pm}$, the net Laplacian matrix is $L{\pm}=D{\pm}-A$. We introduce a new oriented incidence matrix $N{\pm}$ which can keep track of the sign as well as the orientation of each edge of $G$. Also $L{\pm}=N{\pm}(N{\pm})T$. Using this decomposition, we find the numbers of positive and negative spanning trees of $G$ in terms of the principal minors of $L{\pm}$ generalizing Matrix Tree Theorem for an unsigned graph. We present similar results for the signless net Laplacian matrix $Q{\pm}=D{\pm}+A$ along with a combinatorial formula for its determinant.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.