Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,923,290 papers from all fields of science
Search
Sign In
Create Free Account
Conference graph
In the mathematical area of graph theory, a conference graph is a strongly regular graph with parameters v, k = (v − 1)/2, λ = (v − 5)/4, and μ = (v…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Algebraic graph theory
Conference matrix
Graph theory
Quadratic residue
Strongly regular graph
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The number of ideals of $\mathbb{Z}[x]$ containing $x(x-\alpha)(x-\beta)$ with given index
M. Hirasaka
,
Se-jin Oh
2016
Corpus ID: 119135343
It is well-known that a connected regular graph is strongly-regular if and only if its adjacency matrix has exactly three…
Expand
Review
2014
Review
2014
Maximum norms of graphs and their complements
V. Nikiforov
,
Xiying Yuan
2014
Corpus ID: 32370755
Given a graph G; let kGk denote the trace norm of its adjacency matrix, also known as the energy of G: The main result of this…
Expand