The graphs that have antivoltages using groups of small order

DOI10.1016/J.DISC.2019.05.023MaRDI QIDQ2324482zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

gain graphantivoltagevoltage graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

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

• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• A Combinatorial Decomposition Theory
• A characterisation of binary transversal structures
• BICIRCULAR MATROIDS
• Biased graphs IV: Geometrical realizations
• Biased graphs. I: Bias, balance, and gains
• Biased graphs. VII: Contrabalance and antivoltages
• Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
• Bicircular signed-graphic matroids
• Bounding and stabilizing realizations of biased graphs with a fixed group
• Characterizations of signed graphs
• Minors of 3-connected matroids
• On ternary transversal matroids
• Quasi-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)