Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs.
Jing ZhaoJia-Bao LiuSakander HayatPublished in: J. Appl. Math. Comput. (2020)
Keyphrases
- spanning tree
- undirected graph
- minimum spanning tree
- edge weights
- edge disjoint
- minimum spanning trees
- minimum cost
- random graphs
- weighted graph
- minimum weight
- graph mining
- graph model
- graph matching
- graph theory
- connected graphs
- graph representation
- adjacency matrix
- directed graph
- minimum total cost
- root node
- graph kernels
- depth first search
- graph clustering
- bipartite graph
- graph partitioning
- graph structure