Supermagic graphs having a saturated vertex.
Jaroslav IvancoTatiana PollákováPublished in: Discuss. Math. Graph Theory (2014)
Keyphrases
- undirected graph
- directed graph
- labeled graphs
- attributed graphs
- hamiltonian cycle
- graph matching
- minimum weight
- spanning tree
- graph partitioning
- maximum cardinality
- graph theory
- vertex set
- graph mining
- graph structure
- average degree
- graph representation
- graph theoretic
- edge weights
- bayesian networks
- weighted graph
- search algorithm
- np complete
- structured objects
- similarity function
- strongly connected
- bipartite graph
- series parallel
- graph structures
- graph clustering
- case study
- complex structures