On the extending ofk-regular graphs and their strong defining spectrum

DOI10.1080/09720529.2006.10698062zbMATH Open1120.05033OpenAlexW2122667406MaRDI QIDQ5473095FDOQ5473095

Authors: Doost Ali Mojdeh 

Publication date: 19 June 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2006.10698062

Recommendations

• Defining sets and uniqueness in graph colorings: A survey
• On the strong defining spectrum of \(k\)-regular graphs
• On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)
• Defining sets in vertex colorings of graphs and latin rectangles
• On the defining spectrum of \(k\)-regular graphs with \(k-1\) colors
• Graph coloring applications and defining sets in graph theory
• scientific article; zbMATH DE number 5053295
• A characterization of uniquely vertex colorable graphs using minimal defining sets
• Defining sets in (proper) vertex colorings of P_m \times K_n
• The defining numbers for vertex colorings of certain graphs

zbMATH Keywords

coloringregular graphsdefining spectrum

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On defining numbers of vertex colouring of regular graphs

Cited In (5)

• On strongly \(k\)-extendable graphs
• On the defining spectrum of \(k\)-regular graphs with \(k-1\) colors
• On the strong defining spectrum of \(k\)-regular graphs
• Lower and upper bound on defining spectrum of regular graphs
• Spectrum of graphs obtained by operations

This page was built for publication: On the extending ofk-regular graphs and their strong defining spectrum

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