Determining number of generalized and double generalized Petersen graph

DOI10.1007/978-3-030-39219-2_11zbMATH Open1456.05074OpenAlexW3003010817MaRDI QIDQ779185FDOQ779185

Authors: Angsuman Das 

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_11

Recommendations

• 2-domination number of generalized Petersen graphs
• Generalizing the generalized Petersen graphs
• On the domination number of the generalized Petersen graphs
• The exact domination number of the generalized Petersen graphs
• The decycling number of generalized Petersen graphs
• The exact 2-domination number of generalized Petersen graphs
• On some aspects of the generalized Petersen graph
• scientific article; zbMATH DE number 3957138
• On the cop number of generalized Petersen graphs
• Jacobsthal Numbers in Generalized Petersen Graphs

zbMATH Keywords

automorphism groupsfixing number

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cited In (7)

• Determining Number of Kneser Graphs: Exact Values and Improved Bounds
• Distinguishing graphs via cycles
• Determining number of some families of cubic graphs
• The determining number of Kneser graphs
• Enumeration of point-determining graphs
• Symmetry parameters for Mycielskian graphs
• Graphs of order \(n\) with determining number \(n-3\)

This page was built for publication: Determining number of generalized and double generalized Petersen graph

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