On vertex and edge H-irregularity strengths of graphs.
Faraha AshrafMartin BacaZuzana KimákováAndrea Semanicová-FenovcíkováPublished in: Discret. Math. Algorithms Appl. (2016)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- vertex set
- directed graph
- random graphs
- minimum cost
- labeled graphs
- attributed graphs
- approximation algorithms
- complex networks
- connected components
- spanning tree
- edge detection
- strongly connected
- bipartite graph
- directed acyclic graph
- minimum weight
- edge information
- graph theory
- graph matching
- graph mining
- graph structure
- average degree
- minimum spanning tree
- graph structures
- minimum spanning trees
- structured objects
- fractal dimension
- structured data
- random walk
- graph theoretic
- data sets
- graph partitioning
- connected subgraphs
- maximum cardinality