Equitable decompositions of graphs with symmetries
From MaRDI portal
Publication:344919
DOI10.1016/j.laa.2016.10.017zbMath1350.05091arXiv1510.04366OpenAlexW2534504831MaRDI QIDQ344919
Wayne W. Barrett, Amanda E. Francis, Benjamin Z. Webb
Publication date: 25 November 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.04366
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
Spectral gap in random bipartite biregular graphs and applications ⋮ Hidden symmetries in real and theoretical networks ⋮ Techniques for determining equality of the maximum nullity and the zero forcing number of a graph ⋮ Extensions and applications of equitable decompositions for graphs with symmetries ⋮ Characteristic polynomials and zeta functions of equitably partitioned graphs ⋮ Finding hidden structures, hierarchies, and cores in networks via isospectral reduction ⋮ Analysis of node2vec random walks on networks ⋮ General equitable decompositions for graphs with symmetries ⋮ Orbigraphs: a graph-theoretic analog to Riemannian orbifolds ⋮ Fourier decompositions of graphs with symmetries and equitable partitions ⋮ Perfect colorings of regular graphs
Cites Work
- A note on limit points for algebraic connectivity
- Isospectral graph transformations, spectral equivalence, and global stability of dynamical networks
- Synchronization of networks with prescribed degree distributions
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Symmetry in complex networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Equitable decompositions of graphs with symmetries