Results 81 to 90 of about 1,557,851 (153)
Universal Adjacency Matrices with Two Eigenvalues [PDF]
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core
On 14-regular distance magic graphs
Let G be a graph with n vertices. By N(v) we denote the set of all vertices adjacent to v. A bijection f : V(G)→{1, 2, …, n} is a distance magic labeling of G if there exists an integer k such that the sum of labels of all vertices adjacent to v is k for
Petr Kovář, Matěj Krbeček
doaj +1 more source
Upper domatic number of regular graphs [PDF]
Libin Chacko Samuel, Mayamma Joseph
doaj +1 more source
Strongly regular grahphs and directed strongly regular graphs are introduced. Examples of strongly regular graphs are give: Conference graph and latin square graphs. The existence of a directed strongly regular graph with t=0.
Thomsen, Jakob Peter
core
Another construction of edge-regular graphs with regular cliques
We exhibit a new construction of edge-regular graphs with regular cliques that are not strongly regular. The infinite family of graphs resulting from this construction includes an edge-regular graph with parameters (24,8,2).
Koolen J.H. +3 more
core +1 more source
Strongly regular graphs induced by polarities of symmetric designs [PDF]
Graphs ...
Higman, D.G. +2 more
core
Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs
The block graph of a quasi-symmetric design is strongly regular. It is a challenging problem to decide which strongly regular graphs are block graphs of quasi-symmetric designs.
Kusum S. Rajbhar, Rajendra M. Pawale
doaj +1 more source
Edge-regular graphs with regular cliques
We exhibit infinitely many examples of edge-regular graphs that have regular cliques and that are not strongly regular. This answers a question of Neumaier from 1981.MOE (Min.
Jack H. Koolen +3 more
core +1 more source
Fixation Probabilities for Any Configuration of Two Strategies on Regular Graphs. [PDF]
Chen YT, McAvoy A, Nowak MA.
europepmc +1 more source
On Vertex Covering Transversal Domination Number of Regular Graphs. [PDF]
Vasanthi R, Subramanian K.
europepmc +1 more source

