A balanced signed digraph
DOI10.1007/S00373-014-1496-ZzbMATH Open1330.05080OpenAlexW1979199791MaRDI QIDQ897230FDOQ897230
Authors: Yusuke Higuchi, Iwao Sato 
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1496-z
Recommendations
Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Zeta and (L)-functions: analytic theory (11M99)
Cites Work
- Title not available (Why is that?)
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- Title not available (Why is that?)
- On the notion of balance of a signed graph
- Zeta functions of finite graphs and coverings
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
- Title not available (Why is that?)
- Characteristic polynomials of digraphs having a semi-free action
- Generating all graph coverings by permutation voltage assignments
- Zeta functions of finite graphs and coverings. III
- An Ihara formula for partially directed graphs
- Bartholdi zeta functions of group coverings of digraphs
- Zeta functions of digraphs
- Title not available (Why is that?)
- The spherical genus and virtually planar graphs
- Weighted zeta functions of graph coverings
- Characteristic polynomials of ramified uniform covering digraphs
- Weighted zeta functions of digraphs
- Weighted Bartholdi zeta functions of digraphs
- Coverings of digraphs
Cited In (7)
- Title not available (Why is that?)
- Structural Analysis of Directed Signed Networks
- Balanced decompositions of a signed graph
- Algebraic traits of structurally balanced nodes and structurally unbalanced nodes via a geometric-based method
- Ordering of bicyclic signed digraphs by energy
- Necessary and sufficient conditions for the class of \((P,P+1)\)-graph to be balanced
- Quality index of balanced digraphs
This page was built for publication: A balanced signed digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897230)
