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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
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
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
Information Extraction (IE) aims at mining knowledge from unstructured data. Terminology extraction is one of crucial subtasks in… 
2009
2009
Given an author-paper-conference graph, how can we automatically find groups for author, paper and conference respectively… 
2009
2009
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith… 
2008
2008
Recent models have introduced the notion of dimensions and hierarchies in social networks. These models motivate the mining of… 
2004
2004
We determine the Nomura algebras of the type-II matrices belonging to the Bose-Mesner algebra of a conference graph. 
2003
2003
Given λ and µ, it is shown that, unless one of the relations (λ − µ)2 =4 µ, λ − µ = −2, (λ − µ) 2 +2( λ − µ )=4 µ is satisfied…