The graphs that have antivoltages using groups of small order
From MaRDI portal
Publication:2324482
DOI10.1016/J.DISC.2019.05.023zbMATH Open1419.05189OpenAlexW2955912375WikidataQ127575793 ScholiaQ127575793MaRDI QIDQ2324482FDOQ2324482
Authors: Vaidy Sivaraman, Daniel Slilaty 
Publication date: 11 September 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://corescholar.libraries.wright.edu/math/308
Recommendations
- On the girth of voltage graph lifts
- A contribution to the theory of voltage graphs
- The classification of minimal graphs with given abelian automorphism group
- Group connectivity of graphs with diameter at most 2
- Recognition by character degree graph and order of the simple groups of order less than 6000.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Biased graphs. I: Bias, balance, and gains
- A Combinatorial Decomposition Theory
- On ternary transversal matroids
- Biased graphs IV: Geometrical realizations
- Biased graphs. VII: Contrabalance and antivoltages
- A characterisation of binary transversal structures
- Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
- BICIRCULAR MATROIDS
- Minors of 3-connected matroids
- Bounding and stabilizing realizations of biased graphs with a fixed group
- Characterizations of signed graphs
- Quasi-graphic matroids
- Bicircular signed-graphic matroids
This page was built for publication: The graphs that have antivoltages using groups of small order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324482)
