Results 41 to 50 of about 2,798,542 (296)
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} [PDF]
Учёные записки Казанского университета: Серия Физико-математические науки, 2017 J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t.
V.V. Bitkina, A.A. Makhnev
doaj
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
Disconnecting strongly regular graphs
European Journal of Combinatorics, 2014 In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner $2$-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are ...
Sebastian M. Cioaba +2 more
openaire +4 more sources
On the Complexity of Identifying Strongly Regular Graphs
Australas. J Comb., 2022 New result- GI is not AC0-reducible to isomorphism testing of conference graphs; fixed minor bugs and typos from previous ...
openaire +5 more sources
On the structure of compact graphs [PDF]
Opuscula Mathematica, 2017 A simple graph \(G\) is called a compact graph if \(G\) contains no isolated vertices and for each pair \(x\), \(y\) of non-adjacent vertices of \(G\), there is a vertex \(z\) with \(N(x)\cup N(y)\subseteq N(z)\), where \(N(v)\) is the neighborhood of ...
Reza Nikandish, Farzad Shaveisi
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. +2 more
openaire +6 more sources
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
On Strongly Regular Graphs and the Friendship Theorem
MathematicsThis paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós in 1966. The proof relies on a closed-form expression for the Lovász ϑ-function of strongly regular graphs, recently derived by
Igal Sason
doaj +1 more source
FEBS Letters, EarlyView.This study reveals that the small GTPase Rab14 is necessary for human papillomavirus (HPV) infection and plays an essential role in the transport of virions to the trans‐Golgi network (TGN). HPV in the early endosome (EE), which harbors GTP‐bound Rab14, is transported to the TGN through the switch of Rab14 from its GTP‐bound to GDP‐bound form.
Yoshiyuki Ishii, Iwao Kukimoto
wiley +1 more source