File:The graph y = √x(s).png

From formulasearchengine
Jump to navigation Jump to search

The_graph_y_=_√x(s).png(310 × 196 pixels, file size: 757 bytes, MIME type: image/png)

This file is from Wikimedia Commons and may be used by other projects. The description on its file description page there is shown below.

Template:Infobox graph In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges.[1]

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.[2]

Construction

The Ljubljana graph is Hamiltonian and can be constructed from the LCF notation : [47, -23, -31, 39, 25, -21, -31, -41, 25, 15, 29, -41, -19, 15, -49, 33, 39, -35, -21, 17, -33, 49, 41, 31, -15, -29, 41, 31, -15, -25, 21, 31, -51, -25, 23, 9, -17, 51, 35, -29, 21, -51, -39, 33, -9, -51, 51, -47, -33, 19, 51, -21, 29, 21, -31, -39]2.

The Ljubljana graph is the Levi graph of the Ljubljana configuration, a quadrangle-free configuration with 56 lines and 56 points.[2] In this configuration, each line contains exactly 3 points, each points belongs to exactly 3 lines and any two lines intersect in at most one point.

Algebraic properties

The automorphism group of the Ljubljana graph is a group of order 168. It acts transitively on the edges the graph but not on its vertices : there are symmetries taking every edge to any other edge, but not taking every vertex to any other vertex. Therefore, the Ljubljana graph is a semi-symmetric graph, the third smallest possible cubic semi-symmetric graph after the Gray graph on 54 vertices and the Iofinova-Ivanov graph on 110 vertices.[3]

The characteristic polynomial of the Ljubljana graph is

History

The Ljubljana graph was first published in 1993 by Brouwer, Dejter and Thomassen[4] as a self-complementary subgraph of the Dejter graph. [5]

In 1972, Bouwer was already talking of a 112-vertices edge- but not vertex-transitive cubic graph found by R. M. Foster, nonetheless unpublished.[6] Conder, Malnič, Marušič, Pisanski and Potočnik rediscovered this 112-vertices graph in 2002 and named it the Ljubljana graph after the capital of Slovenia.[2] They proved that it was the unique 112-vertices edge- but not vertex-transitive cubic graph and therefore that was the graph found by Foster.

Gallery

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  1. 22 year-old Systems Analyst Rave from Merrickville-Wolford, has lots of hobbies and interests including quick cars, property developers in singapore and baking. Always loves visiting spots like Historic Monuments Zone of Querétaro.

    Here is my web site - cottagehillchurch.com
  2. 2.0 2.1 2.2 Conder, M.; Malnič, A.; Marušič, D.; Pisanski, T.; and Potočnik, P. "The Ljubljana Graph." 2002. [1].
  3. Marston Conder, Aleksander Malnič, Dragan Marušič and Primž Potočnik. "A census of semisymmetric cubic graphs on up to 768 vertices." Journal of Algebraic Combinatorics: An International Journal. Volume 23, Issue 3, pages 255-294, 2006.
  4. Brouwer, A. E.; Dejter, I. J.; and Thomassen, C. "Highly Symmetric Subgraphs of Hypercubes." J. Algebraic Combinat. 2, 25-29, 1993.
  5. Klin M.; Lauri J.; Ziv-Av M. "Links between two semisymmetric graphs on 112 vertices through the lens of association schemes", Jour. Symbolic Comput., 47–10, 2012, 1175–1191.
  6. Bouwer, I. A. "On Edge But Not Vertex Transitive Regular Graphs." J. Combin. Th. Ser. B 12, 32-40, 1972.

Summary

Description
English: The graph y = .
Date (UTC)
Source Own work (Original text: I (Robo37 (talk)) created this work entirely by myself.)
Author Robo37 (talk)

Licensing

Public domain This work has been released into the public domain by its author, Robo37 at English Wikipedia. This applies worldwide.
In some countries this may not be legally possible; if so:
Robo37 grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

Original upload log

The original description page was here. All following user names refer to en.wikipedia.
Date/Time Dimensions User Comment
2009-11-22 11:26 310×196× (1489 bytes) Robo37 Reverted to version as of 11:49, 25 August 2009
2009-11-22 11:21 911×645× (5079 bytes) Robo37 Reverted to version as of 11:34, 25 August 2009
2009-08-25 11:49 310×196× (1489 bytes) Robo37
2009-08-25 11:34 911×645× (5079 bytes) Robo37 {{Information |Description = The graph y = <math>\sqrt{x}_s</math>. |Source = I (~~~) created this work entirely by myself. |Date = ~~~~~ |Author = ~~~ |other_versions = }}

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

25 August 2009

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current16:30, 19 March 2015Thumbnail for version as of 16:30, 19 March 2015310 × 196 (757 bytes)wikimediacommons>RokerHROoptipng -o7 -i0 → 49.16% decrease

There are no pages that use this file.