The defining numbers for vertex colorings of certain graphs
From MaRDI portal
Publication:5480697
zbMATH Open1097.05020MaRDI QIDQ5480697FDOQ5480697
Authors: Doost Ali Mojdeh, Nader Jafari Rad, Abdollah Khodkar 
Publication date: 3 August 2006
Recommendations
- On the defining number for vertex colorings of a family of graphs
- Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
- On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)
- Defining sets in (proper) vertex colorings of P_m \times K_n
- Defining numbers in some of the Harary graphs
Cited In (11)
- Determination of the size of defining set for Steiner triple systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)
- Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
- Defining numbers in some of the Harary graphs
- On the defining number for vertex colorings of a family of graphs
- On the extending ofk-regular graphs and their strong defining spectrum
- Constructing regular graphs with smallest defining number
- On the defining number of \(K_{2n}\;1\)-factors
- Defining sets in (proper) vertex colorings of P_m \times K_n
This page was built for publication: The defining numbers for vertex colorings of certain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480697)
