Pages that link to "Item:Q5020420"
From MaRDI portal
The following pages link to Distinguishing number and distinguishing index of certain graphs (Q5020420):
Displaying 14 items.
- The distinguishing numbers of graphs on closed surfaces (Q764885) (← links)
- The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920) (← links)
- Distinguishing index of maps (Q2011148) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- Distinguishing number and distinguishing index of neighbourhood corona of two graphs (Q3299359) (← links)
- Stabilizing the distinguishing number of a graph (Q4633988) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593) (← links)
- The distinguishing number (index) and the domination number of a graph (Q4986551) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- The distinguishing number and the distinguishing index of line and graphoidal graph(s) (Q5154552) (← links)
- The chromatic distinguishing index of certain graphs (Q5154569) (← links)
- (Q6166316) (← links)