Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations

Broader (1)

Algebraic graph theory
Conference matrixGraph theoryQuadratic residueStrongly regular graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Regular Hadamard matrices constructed from Hadamard 2-designs and conference graphs
2016
2016
The number of ideals of $\mathbb{Z}[x]$ containing $x(x-\alpha)(x-\beta)$ with given index
It is well-known that a connected regular graph is strongly-regular if and only if its adjacency matrix has exactly three… 
Review
2014
Review
2014
Maximum norms of graphs and their complements
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… 
2010
2010
Some characterizations of strongly regular graphs with respect to their vertex deleted subgraphs
  • M. Lepovic
  • Discrete Mathematics
  • 2010
  • Corpus ID: 28227777
2010
2010
Automatic Domain Terminology Extraction Using Graph Mutual Reinforcement
Information Extraction (IE) aims at mining knowledge from unstructured data. Terminology extraction is one of crucial subtasks in… 
2009
2009
PaCK: Scalable parameter-free clustering on K-partite graphs
Given an author-paper-conference graph, how can we automatically find groups for author, paper and conference respectively… 
2009
2009
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith… 
2008
2008
The Layered World of Scientific Conferences
Recent models have introduced the notion of dimensions and hierarchies in social networks. These models motivate the mining of… 
2004
2004
Type-II Matrices Attached to Conference Graphs
We determine the Nomura algebras of the type-II matrices belonging to the Bose-Mesner algebra of a conference graph. 
2003
2003
STRONGLY REGULAR GRAPHS: VALUES OF λ AND µ FOR WHICH THERE ARE ONLY FINITELY MANY FEASIBLE (v, k, λ, µ) ∗
Given λ and µ, it is shown that, unless one of the relations (λ − µ)2 =4 µ, λ − µ = −2, (λ − µ) 2 +2( λ − µ )=4 µ is satisfied… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)