Determining number of some families of cubic graphs

DOI10.22124/JART.2020.16856.1209MaRDI QIDQ5854471zbMATH OpenOpenAlexFDO

Authors

Publication date 17 March 2021

Full work available at URL https://jart.guilan.ac.ir/article_4395_e661752d8724199cb817454ce3fc737d.pdf

zbMATH Keywords

cubic graphsautomorphism groupsfixing number

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Recommendations

• Determining number of generalized and double generalized Petersen graph
• Graphs of order \(n\) with determining number \(n-3\)
• Determining Number of Kneser Graphs: Exact Values and Improved Bounds
• The determining number of a Cartesian product
• The determining number of Kneser graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3349883 (Why is no real title available?)
• A theorem on tait colorings with an application to the generalized Petersen graphs
• An infinite family of biquasiprimitive 2-arc transitive cubic graphs
• Automorphisms of a family of cubic graphs
• Cubic vertex-transitive non-Cayley graphs of order 8p
• Destroying automorphisms by fixing nodes
• Determining number of generalized and double generalized Petersen graph
• Identifying graph automorphisms using determining sets
• On automorphisms and structural properties of double generalized Petersen graphs
• On cubic non-Cayley vertex-transitive graphs
• Self-dual configurations and regular graphs
• The classification of Hamiltonian generalized Petersen graphs
• The determining number of Kneser graphs
• The determining number of a Cartesian product
• The full automorphism groups, determining sets and resolving sets of coprime graphs

Cited in

(5)

• Determining Number of Kneser Graphs: Exact Values and Improved Bounds
• The determining number of a Cartesian product
• Poset properties with respect to semi-ideal based zero-divisor graph
• ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a
• Graphs of order \(n\) with determining number \(n-3\)

This page was built for publication: Determining number of some families of cubic graphs

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