Bounds for Kirchhoff index and Laplacian-energy-like invariant of some derived graphs of a regular graph.
Ruhul AminSk. Md. Abu NayeemPublished in: Discret. Math. Algorithms Appl. (2020)
Keyphrases
- spectral decomposition
- graph structure
- graph representation
- weighted graph
- graph matching
- graph theory
- directed graph
- query graph
- graph theoretic
- graph construction
- adjacency matrix
- laplacian matrix
- graph structures
- graph laplacian
- heat kernel
- graph databases
- graph classification
- graph mining
- labeled graphs
- graph partitioning
- graph model
- graph data
- graph theoretical
- graph isomorphism
- spanning tree
- graph search
- graph clustering
- undirected graph
- graph properties
- structural pattern recognition
- subgraph isomorphism
- bipartite graph
- dynamic graph
- series parallel
- upper bound
- edge weights
- random graphs
- lower bound
- directed acyclic
- graph kernels
- graph representations
- maximum clique
- index structure
- topological information
- random walk
- evolving graphs
- minimum spanning tree
- neighborhood graph
- graph layout
- dense subgraphs
- finding the shortest path
- graph patterns
- maximum common subgraph
- energy consumption
- spectral clustering
- structured data
- energy minimization
- attributed graphs
- planar graphs
- connected graphs
- adjacency graph
- polynomial time complexity
- laplace beltrami
- directed acyclic graph
- suffix tree
- maximal cliques
- small world
- complex networks
- community discovery
- web graph
- semi supervised
- shortest path