Undirected bipartite graph with 112 vertices and 168 edges
Ljubljana graph
The Ljubljana graph as a covering graph of the Heawood graph
Vertices
112
Edges
168
Radius
7
Diameter
8
Girth
10
Automorphisms
168
Chromatic number
2
Chromatic index
3
Properties
Cubic Semi-symmetric Hamiltonian
Table of graphs and parameters
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 (the capital of Slovenia).[1][2]
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.[1]
^ abConder, M.; Malnič, A.; Marušič, D.; Pisanski, T.; and Potočnik, P. "The Ljubljana Graph." 2002. [1].
of graph theory, the Ljubljanagraph is an undirected bipartite graph with 112 vertices and 168 edges, rediscovered in 2002 and named after Ljubljana (the...
graphs include the Gray graph (the smallest semi-symmetric cubic graph), the Ljubljanagraph, and the Tutte 12-cage. The Frucht graph is one of the five smallest...
of two mutually incident tetrahedra. The Ljubljanagraph on 112 vertices is the Levi graph of the Ljubljana configuration. Grünbaum, Branko (2006), "Configurations...
Dejter graph admits a 3-factorization into two copies of the Ljubljanagraph, which is the third smallest existing semi-symmetric cubic graph of regular...
semi-symmetric Ljubljanagraph of girth 10. In 1972, I. Z. Bouwer attributed a graph with the mentioned properties of the Ljubljanagraph to R. M. Foster...
Ljubljana Jože Pučnik Airport (Slovene: Letališče Jožeta Pučnika Ljubljana) (IATA: LJU, ICAO: LJLJ), also known by its previous name Brnik Airport (Slovene:...
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected...
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...
working in graph theory. He is a professor of mathematics at the University of Ljubljana and the holder of a Canada Research Chair in graph theory at Simon...
50833 Ljubljana Castle (Slovene: Ljubljanski grad, German: Laibacher Schloss) is a castle complex standing on Castle Hill above downtown Ljubljana, the...
In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination...
In the mathematical field of graph theory, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by H. S. M. Coxeter and Robert...
In the mathematical field of graph theory, the Fibonacci cubes or Fibonacci networks are a family of undirected graphs with rich recursive properties...
(algebra), used in various contexts Center (group theory) Center (ring theory) Graph center, the set of all vertices of minimum eccentricity Central tendency...
mathematician and an emeritus professor of mathematics at the University of Ljubljana. He is known for his work in discrete mathematics and combinatorial optimization...
Leybach, is a river in the southern part of the Ljubljana Basin in Slovenia. The capital of Slovenia, Ljubljana, lies on the river. The Ljubljanica rises south...
born 23 December 1980, in Ljubljana, Slovenia. She graduated from the Faculty of Education of the University of Ljubljana in 2003, and in 2008 received...
Remembrance and Comradeship (Slovene: Pot spominov in tovarištva), a walkway in Ljubljana, Slovenia Poznań Fast Tram (Polish: Poznański Szybki Tramwaj), Poland...
basin is estimated at 8,176,000, and is shared by three capital cities: Ljubljana, Zagreb and Belgrade. The Sava is about 2⁄3-navigable for larger vessels:...
Leskovec received a Diploma in Computer Science from the University of Ljubljana, Slovenia, researching semantic networks-based creation of abstracts,...
Global Information