Construction of new larger (a, d)-edge antimagic vertex graphs by using adjacency matrices.
Stefi RahmawatiKiki A. SugengDenny Riama SilabanMirka MillerMartin BacaPublished in: Australas. J Comb. (2013)
Keyphrases
- undirected graph
- strongly connected
- edge weights
- directed graph
- weighted graph
- vertex set
- labeled graphs
- minimum spanning trees
- graph structure
- attributed graphs
- connected components
- directed acyclic graph
- graph construction
- singular value decomposition
- kronecker product
- graph theoretic
- hamiltonian cycle
- minimum weight
- adjacency matrix
- graph structures
- adjacency graph
- construction process
- graph clustering
- spanning tree
- edge information
- graph theory
- bipartite graph
- approximation algorithms
- edge detector
- random walk
- multiscale
- maximum cardinality
- singular values
- random graphs
- graph representation
- input image