Results 71 to 80 of about 4,129,862 (348)

On endomorphism-regularity of (n, n + 1)-graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
The aim of this paper is to investigate End-regularity of [Formula: see text]-graphs which are connected graphs with [Formula: see text] vertices and [Formula: see text] edges.
A. Rajabi, A. Erfanian
doaj   +1 more source

A Spectral Characterization of the S-Clique Extension of the Triangular Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A regular graph is co-edge regular if there exists a constant µ such that any two distinct and non-adjacent vertices have exactly µ common neighbors. In this paper, we show that for integers s ≥ 2 and n large enough, any co-edge-regular graph which is ...
Tan Ying-Ying   +2 more
doaj   +1 more source

Regular $K_3$-regular graphs

open access: yesCoRR
We study graphs that are simultaneously regular with respect to the ordinary vertex degree and regular with respect to the triangle degree, that is, the number of triangles containing a given vertex. We call such graphs regular $K_3$-regular. We investigate the (non-)existence of regular $K_3$-regular graphs with prescribed parameters $(r_2,r_3 ...
Artem Hak   +3 more
openaire   +2 more sources

Emerging experimental and computational methods for studying redox‐regulated structural transitions

open access: yesFEBS Letters, EarlyView.
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

On middle cube graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2015
We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones.
C. Dalfo, M. A. Fiol, M. Mitjana
doaj   +1 more source

Translophagy—A potential link between autophagy impairment and translational errors

open access: yesFEBS Letters, EarlyView.
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk   +11 more
wiley   +1 more source

SHILLA GRAPHS WITH \(b=5\) AND \(b=6\)

open access: yesUral Mathematical Journal, 2021
A \(Q\)-polynomial Shilla graph with \(b = 5\) has intersection arrays \(\{105t,4(21t+1),16(t+1); 1,4 (t+1),84t\}\), \(t\in\{3,4,19\}\). The paper proves that distance-regular graphs with these intersection arrays do not exist.
Alexander A. Makhnev, Ivan N. Belousov
doaj   +1 more source

Regular embeddings of a graph [PDF]

open access: yesPacific Journal of Mathematics, 1983
In this paper we study embeddings of a graph G in Euclidean space R" that are 'regular' in the following sense: given any two distinct vertices u and v of G, the distance between the corresponding points in R" equals a if u and v are adjacent, and equals β otherwise.
openaire   +3 more sources

Prospecting the protein design landscape

open access: yesFEBS Letters, EarlyView.
This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona   +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\)

open access: yesUral 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   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy