Bounds on the minimum edge dominating energy of induced subgraphs of a graph.
Fateme MovahediPublished in: Discret. Math. Algorithms Appl. (2021)
Keyphrases
- weighted graph
- graph mining
- graph databases
- graph properties
- constant factor
- undirected graph
- labeled graphs
- spanning tree
- subgraph isomorphism
- graph structures
- edge weights
- vertex set
- lower bound
- disjoint paths
- minimum energy
- reachability queries
- subgraph mining
- graph data
- graph theory
- graph structure
- graph theoretic
- energy consumption
- upper bound
- frequent subgraph mining
- topological information
- graph representation
- graph patterns
- connected subgraphs
- query graph
- maximum clique
- force field
- min sum
- structured data
- directed graph
- approximation algorithms
- subgraph matching
- graph partitioning
- data structure
- link analysis
- bipartite graph
- energy minimization
- shortest path
- random walk
- worst case
- frequent subgraphs
- graph search
- edge information
- minimum cost
- graph model
- connected components
- level set
- edge detection
- connected dominating set