A neigborhood union condition for nonadjacent vertices in graphs.
Farzad ShaveisiPublished in: Discret. Math. Algorithms Appl. (2017)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- undirected graph
- attributed graphs
- adjacency matrix
- planar graphs
- sufficient conditions
- average degree
- edge weights
- query graph
- vertex set
- directed edges
- hamiltonian cycle
- series parallel
- maximal cliques
- connected subgraphs
- graph theoretic
- graph representation
- graph partitioning
- neural network
- data sets
- maximum cardinality
- connected graphs
- graph theory
- phase transition
- graph matching
- directed graph
- shortest path
- pairwise
- database