The cyclomatic number of connected graphs without solvable orbits

zbMATH Open1305.05230MaRDI QIDQ2906836FDOQ2906836

Authors Gyula Károlyi, Ambrus Pál 

Publication date 5 September 2012

Published in Journal of the Ramanujan Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

solvable groupcirculant graphgraph eigenvaluegraph automorphismcyclomatic numberminimal simple groupprojective algebraic curvesolvable point

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of representation theory (05E10) Connectivity (05C40)

Recommendations

• Solvable graphs of finite groups
• On cubic symmetric non-Cayley graphs with solvable automorphism groups
• On solvable groups and circulant graphs
• Infinitely many nonsolvable groups whose Cayley graphs are Hamiltonian
• Nikolai Ivanovich Lobachevskii (on the bicentenary of his birth)

This page was built for publication: The cyclomatic number of connected graphs without solvable orbits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906836)