On the degrees of a strongly vertex-magic graph.
Camino BalbuenaE. BarkerK. C. DasYuqing LinMirka MillerJoseph F. Ryan SlaminKiki A. SugengMichal TkácPublished in: Discret. Math. (2006)
Keyphrases
- directed graph
- undirected graph
- minimum weight
- graph structure
- labeled graphs
- edge weights
- graph representation
- hamiltonian cycle
- weighted graph
- vertex set
- attributed graphs
- graph theoretic
- random walk
- graph theory
- random graphs
- bipartite graph
- strongly connected
- stable set
- average degree
- maximum cardinality
- graph clustering
- graph mining
- neural network
- graph grammars
- graphical representation
- spanning tree
- directed acyclic graph
- structured data
- optimal solution
- database