Degree sum adjacency polynomial of standard graphs and graph operations.
Sumedha S. ShindeHarishchandra S. RamaneShaila B. GudimaniNarayan SwamyPublished in: Electron. J. Graph Theory Appl. (2022)
Keyphrases
- random graphs
- graph representation
- graph theory
- directed graph
- graph structure
- graph classification
- graph construction
- graph clustering
- graph theoretic
- graph model
- graph mining
- graph databases
- labeled graphs
- graph search
- weighted graph
- strongly connected
- graph matching
- graph properties
- graph partitioning
- graph theoretical
- graph structures
- random walk
- maximum common subgraph
- series parallel
- bipartite graph
- graph isomorphism
- subgraph isomorphism
- graph data
- adjacency graph
- low degree
- small world
- adjacency matrix
- maximal cliques
- inexact graph matching
- dynamic graph
- degree distribution
- spanning tree
- undirected graph
- graph transformation
- reachability queries
- polynomial time complexity
- maximum cardinality
- frequent subgraphs
- graph kernels
- graph drawing
- social networks
- directed acyclic
- evolving graphs
- disk resident
- real world graphs
- connected components
- attributed graphs
- topological information
- planar graphs
- edge weights
- minimum spanning tree