Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

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
Abstract Suppose there exists a Hadamard 2- ( m , m − 1 2 , m − 3 4 ) design having skew incidence matrix. If there exists a… Expand
Is this relevant?
2018
2018
A Note on Siamese Twin Designs Intersecting in a BIBD and a PBD
Suppose there exists a Hadamard 2-$$(m,\frac{m-1}{2},\frac{m-3}{4})$$(m,m-12,m-34) design with skew incidence matrix, and a… Expand
Is this relevant?
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… Expand
Is this relevant?
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… Expand
Is this relevant?
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… Expand
Is this relevant?
2010
2010
Some characterizations of strongly regular graphs with respect to their vertex deleted subgraphs
We say that a regular graph G of order n and degree r>=1 (which is not the complete graph) is strongly regular if there exist non… Expand
Is this relevant?
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… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
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… Expand
  • table 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
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… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?
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. 
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE