Conference graph
id:
conference-graph-284-7028949
title:
Conference graph
text:
In the mathematical area of graph theory, a conference graph is a strongly regular graph with parameters v, k =/2, λ =/4, and μ =/4. It is the graph associated with a symmetric conference matrix, and consequently its order v must be 1 and a sum of two squares. Conference graphs are known to exist for all small values of v allowed by the restrictions, e.g., v = 5, 9, 13, 17, 25, 29, and for all prime powers congruent to 1. However, there are many values of v that are allowed, for which the existe
brand slug:
wiki
category slug:
encyclopedia
description:
Special case of a strongly regular graph
original url:
https://en.wikipedia.org/wiki/Conference_graph
date created:
date modified:
2024-04-22T05:19:07Z
main entity:
{"identifier":"Q5159897","url":"https://www.wikidata.org/entity/Q5159897"}
image:
fields total:
13
integrity:
14