Results 61 to 70 of about 38,730 (201)
Molecules, 2017 Network motifs are patterns of complex networks occurring significantly more frequently than those in random networks. They have been considered as fundamental building blocks of complex networks.
Jialu Hu, Xuequn Shang
doaj +1 more source
Self-Dual and LCD Codes from Kneser Graphs K(n, 2) and Generalized Quadrangles
MathematicsIn this paper, we study self-dual and LCD codes constructed from Kneser graphs K(n, 2) and collinearity graphs of generalized quadrangles using the so-called pure and bordered construction. We determine conditions under which these codes are self-dual or
Dean Crnković, Ana Grbac
doaj +1 more source
Some Inequalities over the Eigenvalues of a Strongly Regular Graph
, 2023 Luís Almeida Vieira
openalex +1 more source
Some New Cyclotomic Strongly Regular Graphs [PDF]
Journal of Algebraic Combinatorics, 1995 Given a field \(F\) and a subset \(D\) of \(F^*\) such that \(D= -D\), one can define a graph \(\Gamma\) with vertex set \(F\) by letting \(x\sim y\) whenever \(y- x\in D\). Several authors have studied the problem of finding sets \(D\) such that the graph \(\Gamma\) is strongly regular and many examples are known.
openaire +2 more sources
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs [PDF]
, 2015 Sylvain Gravier +4 more
openalex +1 more source
q-analogs of strongly regular graphs
Linear Algebra and its ApplicationsWe introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
Michael Braun +4 more
openaire +3 more sources
Some families of directed strongly regular graphs obtained from certain\n finite incidence structures [PDF]
, 2011 Oktay Ölmez, Sung‐Yell Song
openalex +1 more source
Strongly Regular Fusions of Tensor Products of Strongly Regular Graphs
Rocky Mountain Journal of Mathematics, 1994 Let \(G\) and \(H\) be strongly regular graphs with (0, 1)-adjacency matrices \(A_ 0= I\), \(A_ 1\), \(A_ 2= J-I- A_ 1\) and \(B_ 0= I\), \(B_ 1,\) \(B_ 2= J- I- B_ 1\) respectively. The tensor product \(G\otimes H\) is defined to be the nine class association scheme with adjacency matrices \(A_ i\otimes B_ j\). By combining (fusing) some of these nine
openaire +2 more sources
On directed strongly regular Cayley graphs over non-abelian groups with an abelian subgroup of index $2$ [PDF]
, 2022 Xueyi Huang, Lu Lu, Jongyook Park
openalex +1 more source