z-logo
open-access-imgOpen Access
Extending the dual of the Petersen graph
Author(s) -
Thomas Meixner
Publication year - 1997
Publication title -
bulletin of the belgian mathematical society - simon stevin
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.36
H-Index - 31
eISSN - 2034-1970
pISSN - 1370-1444
DOI - 10.36045/bbms/1105737772
Subject(s) - combinatorics , mathematics , vertex (graph theory) , rank (graph theory) , type (biology) , graph , diagram , dual graph , geometry , discrete mathematics , line graph , ecology , statistics , biology
By hypotheses (a) and (c), if {i, j} is a 2-element subset of the type set I of Γ, then there are flags F of co-type {i, j}, such that res(F ) is a rank 2 geometry over the type set {i, j}, and all such {i, j}-residues are isomorphic. Hence, such a geometry Γ can be described by a diagram, in which the types (or even the exact isomorphism types) of all rank-2-residues are listed; this is often done in a graphical way. A graph D is drawn having vertices i ∈ I , one vertex for every type of objects in a hypothetical geometry belonging to the diagram, and the way two vertices i, j ∈ I are connected in the diagram reflects the type Dij of some rank 2 geometry.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom