- Sharp upper bounds of the spectral radius of a graph
2019/06/06 by Ji-Ming Guo, Ji‐Ming Guo, Yidong Wang +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Adjacency matrix #Bound graph #Combinatorics #Complex Network Analysis Techniques #Connectivity #Discrete mathematics #Eigenvalues and eigenvectors #Graph #Graph Labeling and Dimension Problems #Graph energy #Graph power #Graph theory and applications #Line graph #Mathematical analysis #Mathematics #Physics #Simple graph #Spectral radius #Upper and lower bounds #Vertex (graph theory)
- Ramsey linear families and generalized subdivided graphs
1997/06/01 by Yusheng Li, Cecil Rousseau, Cecil C. Rousseau +1 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Bound graph #Combinatorics #Discrete mathematics #Graph #Graph power #Induced subgraph #Limits and Structures in Graph Theory #Line graph #Mathematics #Vertex (graph theory)
- Finding approximate separators and computing tree width quickly
1992/01/01 by Bruce A. Reed · 7 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Graph Labeling and Dimension Problems #Combinatorics #Component (thermodynamics) #Graph #Mathematics #Connected component #Time complexity #Set (abstract data type) #Bound graph #Discrete mathematics #Computer science #Graph power #Physics #Line graph
- Maximum hitting time for random walks on graphs
1990/09/01 by Graham Brightwell, Peter Winkler · 2 citations
Computer Science · Mathematics · #1-planar graph #Bound graph #Clique number #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Graph power #Hitting time #Line graph #Markov Chains and Monte Carlo Methods #Mathematics #Optimization and Search Problems #Path graph #Random graph #Random regular graph #Vertex (graph theory) #Wheel graph
- Maximum induced trees in graphs
1986/08/01 by Paul Erdős, Paul Erdös, Michael Saks +2 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Bound graph #Clique #Combinatorics #Complexity and Algorithms in Graphs #Connectivity #Discrete mathematics #Graph #Graph power #Independence number #Limits and Structures in Graph Theory #Line graph #Mathematics #Upper and lower bounds
- Arboricity and Subgraph Listing Algorithms
1985/02/01 by Norishige Chiba, Takao Nishizeki · 13 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Optimization and Search Problems #Combinatorics #Arboricity #Mathematics #Degeneracy (biology) #Graph #Time complexity #Clique #Upper and lower bounds #Bound graph #Planar graph #Simple graph #Discrete mathematics #Algorithm #Graph power #Line graph
- An inequality for the chromatic number of a graph
1968/01/01 by G. Szekeres, G Szekeres, Herbert S. Wilf · 2 citations
Computer Science · Engineering · Mathematics · #Adjacency matrix #Bound graph #Chromatic scale #Combinatorics #Discrete mathematics #Eigenvalues and eigenvectors #Graph #Graph Labeling and Dimension Problems #Graph power #Graph theory and applications #Line graph #Mathematics #Physics #Vertex (graph theory) #Wheel graph #graph theory and CDMA systems