On (a, 1)-Vertex-Antimagic Edge Labeling of Regular Graphs.
Martin BacaAndrea Semanicová-FenovcíkováTao-Ming WangGuang-Hui ZhangPublished in: J. Appl. Math. (2015)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- approximation algorithms
- labeled graphs
- spanning tree
- minimum weight
- random graphs
- directed acyclic graph
- graph structure
- reachability queries
- complex networks
- attributed graphs
- minimum spanning trees
- strongly connected
- active learning
- bipartite graph
- graph matching
- maximum cardinality
- edge detection
- hamiltonian cycle
- minimum cost
- minimum spanning tree
- subgraph isomorphism
- graph theory
- complex structures
- connected components
- unsupervised learning
- graph clustering
- average degree
- densely connected
- pairwise
- edge information