On the spectrum and number of convex sets in graphs
From MaRDI portal
Publication:2339431
DOI10.1016/j.disc.2015.01.024zbMath1309.05116OpenAlexW2089778934MaRDI QIDQ2339431
Jason I. Brown, Ortrud R. Oellermann
Publication date: 1 April 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.01.024
random graphscographsPaley graphs\(m\)-convexityconvex geometriesalignments\(\#P\)-completefinite topologies\(g\)-convexityclique-convex graphscontinuum property
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with a minimal number of convex sets
- Enumeration of subtrees of trees
- On the computation of the hull number of a graph
- Distance-hereditary graphs
- Complement reducible graphs
- On the Lambert \(w\) function
- Partitioning a graph into convex sets
- Struktur- und Anzahlformeln für Topologien auf endlichen Mengen
- The Complexity of Counting in Sparse, Regular, and Planar Graphs
- Minimal trees and monophonic convexity
- CLIQUE NUMBERS OF PALEY GRAPHS
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Steiner Trees and Convex Geometries
- Convexity in Graphs and Hypergraphs
- Convexity and HHD-Free Graphs
- Asymptotics of a sequence of sparse binomial-type polynomials
- The Pathwidth and Treewidth of Cographs
- Probability Inequalities for Sums of Bounded Random Variables
- On the computer enumeration of finite topologies
- The Number of Finite Topologies
This page was built for publication: On the spectrum and number of convex sets in graphs
