Centrosymmetric graphs and a lower bound for graph energy of fullerenes.
Ali Reza AshrafiMorteza FaghaniGyula Y. KatonaPublished in: Discuss. Math. Graph Theory (2014)
Keyphrases
- lower bound
- graph representation
- upper bound
- graph theory
- weighted graph
- labeled graphs
- graph structure
- graph structures
- graph matching
- directed graph
- graph clustering
- adjacency matrix
- graph theoretic
- graph classification
- graph mining
- graph construction
- graph model
- graph theoretical
- graph databases
- random graphs
- branch and bound algorithm
- undirected graph
- graph properties
- maximum clique
- bipartite graph
- graph search
- subgraph isomorphism
- series parallel
- graph transformation
- energy consumption
- spanning tree
- graph partitioning
- graph isomorphism
- maximum common subgraph
- graph kernels
- connected dominating set
- graph data
- edge weights
- random walk
- branch and bound
- graph patterns
- directed acyclic
- reachability queries
- dynamic graph
- worst case
- graph representations
- minimum spanning tree
- structural pattern recognition
- lower and upper bounds
- objective function
- maximum cardinality
- bounded treewidth
- web graph
- densely connected
- adjacency graph
- query graph
- inexact graph matching
- planar graphs
- finding the shortest path
- evolving graphs
- real world graphs
- np hard
- connected graphs
- connected components
- dense subgraphs
- graph layout
- constant factor
- massive graphs
- social networks
- optimal solution
- graph embedding
- graphical models
- community discovery
- approximation algorithms
- attributed graphs
- energy minimization