Results 41 to 50 of about 2,975,002 (298)

D-magic strongly regular graphs

AKCE International Journal of Graphs and Combinatorics, 2020
For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj   +1 more source

Binary Codes of Strongly Regular Graphs [PDF]

Designs, Codes and Cryptography, 1999
The binary code of a graph is the linear code generated by the rows of the adjacency matrix of the graph. The authors investigate, with the exception of two parameter sets, the codes from known strongly regular graphs with fewer than 45 vertices. They also consider the codes obtained when the main diagonal of the adjacency matrix is the all-one vector.
Haemers, W.H., Peeters, M.J.P., van Rijckevorsel, J.M.   +2 more
openaire   +6 more sources

Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products †

Entropy, 2023
This paper provides new observations on the Lovász θ-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular graphs.
Igal Sason
doaj   +1 more source

On the construction and comparison of graph irregularity indices [PDF]

Kragujevac Journal of Science, 2017
Irregularity indices are generally used for quantitative characterization of topological structure of non-regular graphs. According to a widely accepted preconception, using a topological invariant (called a graph irregularity index) for that purpose ...
Réti Tamás, Tóth-Laufer Edit
doaj   +1 more source

Automorphism groups of the constituent graphs of integral distance graphs

AKCE International Journal of Graphs and Combinatorics, 2023
In this paper, we consider the automorphism groups of Cayley graphs which are a basis of a complete Boolean algebra of strongly regular graphs, one of such graph is the integral distance graph [Formula: see text] The automorphism groups of the integral ...
O. Habineza, E. Mwambene
doaj   +1 more source

Hemisystems and strongly regular graphs

Discrete Applied Mathematics
In a recent paper, it was constructed a family of hemisystems of H(3,p2), for every prime p of the form p=1+4a2, stabilised by PSL(2,p)×C[Formula presented]. In the case p=5, the full automorphism group is 3.A7, and the hemisystem is isomorphic to a sporadic one described by A. Cossidente and T. Penttila in 2005.
Pallozzi Lavorante V., Romaniello F., Smaldore V.   +2 more
openaire   +1 more source

Strongly regular graphs with strongly regular decomposition

Linear Algebra and its Applications, 1989
Partitions of strongly regular graphs into two strongly regular subgraphs are studied. Such partitions give rise to quasi-symmetric designs and other types of interesting configurations. Necessary conditions for the existence of such partitions are derived. Several constructions are given and a table of all feasible parameter sets up to 300 vertices is
Haemers, W. H., Higman, Donald G.
openaire   +2 more sources

Some new models for multiprocessor interconnection networks [PDF]

Yugoslav Journal of Operations Research, 2016
A multiprocessor system can be modeled by a graph G. The vertices of G correspond to processors while edges represent links between processors. To find suitable models for multiprocessor interconnection networks (briefly MINs), one can apply ...
Cvetković Dragoš, Davidović Tatjana, Jovanović Irena M.   +2 more
doaj   +1 more source

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

FEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai, Mohyeddine Omrane, Nassima Benzoubir, Didier Samuel, Ama Gassama‐Diagne   +4 more
wiley   +1 more source

GRAPHS \(\Gamma\) OF DIAMETER 4 FOR WHICH \(\Gamma_{3,4}\) IS A STRONGLY REGULAR GRAPH WITH \(\mu=4,6\)

Ural Mathematical Journal
We consider antipodal graphs \(\Gamma\) of diameter 4 for which  \(\Gamma_{1,2}\) is a strongly regular graph. A.A. Makhnev and D.V. Paduchikh noticed that, in this case, \(\Delta=\Gamma_{3,4}\) is a strongly regular graph without triangles.
Alexander A. Makhnev, Mikhail P. Golubyatnikov, Konstantin S. Efimov   +2 more
doaj   +1 more source