The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Polarities of G. Higman's symmetric design and a strongly regular graph on 176 vertices.”

On strongly regular graphs with m2 = qm3 and m3 = qm2

Lepovic, Mirko (2011)

Serdica Mathematical Journal

Similarity:

2010 Mathematics Subject Classification: 05C50. We say that a regular graph G of order n and degree r і 1 (which is not the complete graph) is strongly regular if there exist non-negative integers t and q such that |SiЗSj| = t for any two adjacent vertices i and j, and |SiЗSj| = q for any two distinct non-adjacent vertices i and j, where Sk denotes the neighborhood of the vertex k. Let l1 = r, l2 and l3 be the distinct eigenvalues of a connected strongly regular graph. Let...

Polynomial time algorithms for two classes of subgraph problem

Sriraman Sridharan (2008)

RAIRO - Operations Research

Similarity:

We design a polynomial time algorithm for finding a -1)- regular subgraph in a -regular graph without any induced star (claw-free). A polynomial time algorithm for finding a cubic subgraph in a 4-regular locally connected graph is also given. A family of -regular graphs with an induced star (, not containing any (-1)-regular subgraph is also constructed.