Results 41 to 50 of about 40,584 (295)
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
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
5-chromatic strongly regular graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nick C. Fiala, Willem H. Haemers
openaire +4 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š +2 more
doaj +1 more source
Switching for Small Strongly Regular Graphs [PDF]
Australas. J Comb., 2020 21 pages; accepted version, 26 Tables, 1 ...
openaire +4 more sources
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. +2 more
openaire +5 more sources
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Ural Mathematical JournalWe 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
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source