AbstractTaylor's graph is a strongly regular graph that is the unique descendant of a certain regular two-graph on q3 + 1 points, where q is an odd prime power. It has the parameters of the point graph of a putative partial geometry PG(q − 1, 12(q2 − 1), 12(q − 1)) and so is pseudo-geometric. Here we investigate the question as to whether or not Taylor's graph is geometric and discover that it is when q = 3 but not in the cases q = 5, 7
Twelve new strongly regular graphs with parameters (81, 30, 9, 12) are found as graphs invariant und...
AbstractWe prove that a planar graph is generically rigid in the plane if and only if it can be embe...
Graphs are usually represented as geometric objects drawn in the plane, consisting of nodes and curv...
AbstractTaylor's graph is a strongly regular graph that is the unique descendant of a certain regula...
If s is an even power of a prime and t equals s or ss, we show the existence of pseudo-geometric str...
AbstractThe values t= 1, 3, 5, 6, 9 satisfy the standard necessary conditions for existence of a gen...
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vert...
Let θ 0 be a particular vertex of a strongly regular graph G with parameters v, n1, p 11 1 p 11 2 . ...
The early development of graph theory was heavily motivated and influenced by topological and geomet...
The values t = 1, 3, 5, 6, 9 satisfy the standard necessary conditions for existence of a generalise...
We give some new representations of the partial geometry pg(6, 6, 2), which was constructed by van L...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
AbstractIt has long been an open problem whether or not there exists a partial geometry with paramet...
We give several characterizations of partition lattices and projective geometries. Most of these cha...
We introduce a topological graph parameter s(G), defined for any graph G. This parameter characteriz...
Twelve new strongly regular graphs with parameters (81, 30, 9, 12) are found as graphs invariant und...
AbstractWe prove that a planar graph is generically rigid in the plane if and only if it can be embe...
Graphs are usually represented as geometric objects drawn in the plane, consisting of nodes and curv...
AbstractTaylor's graph is a strongly regular graph that is the unique descendant of a certain regula...
If s is an even power of a prime and t equals s or ss, we show the existence of pseudo-geometric str...
AbstractThe values t= 1, 3, 5, 6, 9 satisfy the standard necessary conditions for existence of a gen...
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vert...
Let θ 0 be a particular vertex of a strongly regular graph G with parameters v, n1, p 11 1 p 11 2 . ...
The early development of graph theory was heavily motivated and influenced by topological and geomet...
The values t = 1, 3, 5, 6, 9 satisfy the standard necessary conditions for existence of a generalise...
We give some new representations of the partial geometry pg(6, 6, 2), which was constructed by van L...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
AbstractIt has long been an open problem whether or not there exists a partial geometry with paramet...
We give several characterizations of partition lattices and projective geometries. Most of these cha...
We introduce a topological graph parameter s(G), defined for any graph G. This parameter characteriz...
Twelve new strongly regular graphs with parameters (81, 30, 9, 12) are found as graphs invariant und...
AbstractWe prove that a planar graph is generically rigid in the plane if and only if it can be embe...
Graphs are usually represented as geometric objects drawn in the plane, consisting of nodes and curv...
DOI
Add to ORKG