Results 91 to 100 of about 3,100,536 (300)
Regular graphs with four eigenvalues [PDF]
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core +2 more sources
The Cayley graph built upon the semigroup of left ideals of a ring
上海师范大学学报. 自然科学版, 2014 We investigate the interaction between a ring R and the Cayley graph Cay(L(R)) of the semigroup of left ideals of R,as well as subdigraphs of this graph.Graph theoretic properties of these graphs are investigated,such as transitive closure,girth,radius ...
Aihua Li, Ralph P.Tucci
doaj +1 more source
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core
Molecular Oncology, EarlyView.Taxanes are widely used chemotherapeutics whose effects on cellular mechanics remain poorly understood. We show that paclitaxel induces rapid cellular contraction by promoting GEF‐H1 dissociation from microtubules and non‐muscle myosin II activation through RhoA/ROCK.
Gloria Asensio‐Juárez +5 more
wiley +1 more source
rc-continuous functions and functions with rc-strongly closed graph
International Journal of Mathematics and Mathematical Sciences, 2003 The family of regular closed subsets of a topological space is used to introduce two concepts concerning a function f from a space X to a space Y. The first of them is the notion of f being rc-continuous.
Bassam Al-Nashef
doaj +1 more source
Strongly Regular Graphs with Maximal Energy [PDF]
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Koolen and Moulton have proved that the energy of a graph on n vertices is at most n(1 + √n)/2, and that equality holds if and only if the graph is ...
Haemers, W.H.
core
A (57,14,1) strongly regular graph does not exist
, 1983 We show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalues: 1∗14, 38∗2, 18∗(−5); (1, −1)-eigenvalues: 1∗28, 38∗(− 5), 18∗9) does not ...
Wilbrink, H.A., Brouwer, A.E.
core +1 more source
Molecular Oncology, EarlyView.This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault +12 more
wiley +1 more source
Switching for Small Strongly Regular Graphs
Australas. J Comb., 2020 21 pages; accepted version, 26 Tables, 1 ...
openaire +5 more sources
Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1 [PDF]
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m4 for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m4, 2m4 ...
Xiang, Q., Haemers, W.H.
core