Distinguishing numbers of finite 4-valent vertex-transitive graphs.
Florian LehnerGabriel VerretPublished in: Ars Math. Contemp. (2020)
Keyphrases
- undirected graph
- directed graph
- attributed graphs
- labeled graphs
- real numbers
- hamiltonian cycle
- graph matching
- connected subgraphs
- maximum cardinality
- structured objects
- vertex set
- graph theory
- average degree
- graph mining
- minimum weight
- graph structure
- graph theoretic
- series parallel
- small world
- random graphs
- social networks
- graph representation
- complex structures
- finite number
- weighted graph
- clustering algorithm