Shrikhande graph
id:
shrikhande-graph-306-10014448
title:
Shrikhande graph
text:
In the mathematical field of graph theory, the Shrikhande graph is a graph discovered by S. S. Shrikhande in 1959. It is a strongly regular graph with 16 vertices and 48 edges, with each vertex having degree 6. Every pair of nodes has exactly two other neighbors in common, whether or not the pair of nodes is connected.
brand slug:
wiki
category slug:
encyclopedia
description:
Undirected graph named after S. S. Shrikhande
original url:
https://en.wikipedia.org/wiki/Shrikhande_graph
date created:
date modified:
2023-11-19T16:09:28Z
main entity:
{"identifier":"Q3115537","url":"https://www.wikidata.org/entity/Q3115537"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/1/19/Shrikhande_graph_square.svg","width":394,"height":394}
fields total:
13
integrity:
15