Determining number of some families of cubic graphs
From MaRDI portal
Publication:5854471
DOI10.22124/JART.2020.16856.1209zbMATH Open1474.05176OpenAlexW3108062741MaRDI QIDQ5854471FDOQ5854471
Authors:
Publication date: 17 March 2021
Full work available at URL: https://jart.guilan.ac.ir/article_4395_e661752d8724199cb817454ce3fc737d.pdf
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cites Work
- Title not available (Why is that?)
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
- Destroying automorphisms by fixing nodes
- Identifying graph automorphisms using determining sets
- On cubic non-Cayley vertex-transitive graphs
- Title not available (Why is that?)
- The classification of Hamiltonian generalized Petersen graphs
- Cubic vertex-transitive non-Cayley graphs of order \(8p\)
- Automorphisms of a family of cubic graphs
- An infinite family of biquasiprimitive 2-arc transitive cubic graphs
- On automorphisms and structural properties of double generalized Petersen graphs
- Determining number of generalized and double generalized Petersen graph
- The determining number of a Cartesian product
- The determining number of Kneser graphs
- 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)
