Results 51 to 60 of about 3,100,536 (300)
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products
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]
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
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
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. +2 more
openaire +1 more source
Strongly regular graphs with strongly regular decomposition
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]
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š +2 more
doaj +1 more source
The uniqueness of the strongly regular graph on 77 points [PDF]
We show the uniqueness of the strongly regular graph with parameters ¿ = 77, k = 16, ¿ = O, µ = 4 embedding it in the Higman-Sims graph as a second subconstituent, and indicate the existence of a sporadic ...
A. E. Brouwer +2 more
core +1 more source
Obesity raises blood levels of PAI‐1, a protein linked to metabolic dysfunction‐associated steatotic liver disease in people with obesity. In female mice fed a high‐fat diet, partially lowering PAI‐1 led to smaller subcutaneous fat cells and lower liver cholesterol, without changing body weight or insulin sensitivity.
Claudia E. Ramirez Bustamante +10 more
wiley +1 more source
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 +2 more
doaj +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source

