Nordhaus-Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates.
Johannes H. HattinghOsama A. SalehLucas C. van der MerweTerry J. WaltersPublished in: Graphs Comb. (2016)
Keyphrases
- graph representation
- graph theory
- weighted graph
- undirected graph
- random graphs
- stable set
- edge weights
- solution path
- connected components
- graph model
- graph structure
- graph theoretic
- graph based algorithm
- bipartite graph
- small number
- graph construction
- bounded degree
- root node
- data sets
- spanning tree
- graph mining
- graph matching
- random walk
- computational complexity
- search engine