Vertex-edge domination in interval and bipartite permutation graphs.
Subhabrata PaulDinabandhu PradhanShaily VermaPublished in: Discuss. Math. Graph Theory (2023)
Keyphrases
- undirected graph
- vertex set
- directed graph
- weighted graph
- edge weights
- spanning tree
- approximation algorithms
- random graphs
- connected components
- graph structure
- bipartite graph
- directed acyclic graph
- complex networks
- adjacency matrix
- graph partitioning
- graph model
- minimum weight
- average degree
- minimum cost
- np complete
- maximum cardinality
- strongly connected
- graph clustering
- random walk