Ljubljana graph
id:
ljubljana-graph-258-3401990
title:
Ljubljana graph
text:
In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges, rediscovered in 2002 and named after Ljubljana. It is a cubic graph with diameter 8, radius 7, chromatic number 2 and chromatic index 3. Its girth is 10 and there are exactly 168 cycles of length 10 in it. There are also 168 cycles of length 12.
brand slug:
wiki
category slug:
encyclopedia
description:
Undirected bipartite graph with 112 vertices and 168 edges
original url:
https://en.wikipedia.org/wiki/Ljubljana_graph
date created:
date modified:
2023-08-30T17:41:02Z
main entity:
{"identifier":"Q3034788","url":"https://www.wikidata.org/entity/Q3034788"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/76/Ljubljana_graph_--_Heawood_representation.jpg","width":1447,"height":1484}
fields total:
13
integrity:
15