Pages that link to "Item:Q870075"
From MaRDI portal
The following pages link to Structural properties of twin-free graphs (Q870075):
Displayed 14 items.
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Twin subgraphs and core-semiperiphery-periphery structures (Q1722674) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- On cages admitting identifying codes (Q2426452) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Characterization theorems for the spaces of derivations of evolution algebras associated to graphs (Q4965919) (← links)
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
- Some classifications of graphs with respect to a set adjacency relation (Q5859499) (← links)