Results 61 to 70 of about 3,086,920 (343)
Max-cut and extendability of matchings in distance-regular graphs [PDF]
European journal of combinatorics (Print), 2015 A connected graph G of even order v is called t -extendable if it contains a perfect matching, t v / 2 and any matching of t edges is contained in some perfect matching. The extendability of G is the maximum t such that G is t -extendable.
S. Cioabă, J. Koolen, Weiqiang Li
semanticscholar +1 more source
On distance-regularity in graphs
Journal of Combinatorial Theory, Series B, 1982 AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on the same vertex set in which a pair of vertices is adjacent if and only if their distance apart is i in G. If G is distance-regular, then Ai is a polynomial of degree i in A. It is shown that the converse is also true.
openaire +1 more source
Open Distance-Pattern Uniform Graphs [PDF]
, 2009 All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core +1 more source
The matching polynomial of a distance-regular graph
International Journal of Mathematics and Mathematical Sciences, 2000 A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance-regular graph can also be determined from ...
Robert A. Beezer, E. J. Farrell
doaj +1 more source
On bipartite distance-regular graphs with exactly two irreducible T-modules with endpoint two [PDF]
, 2016 Let Γ denote a bipartite distance-regular graph with diameter D ≥ 4 and valency k ≥ 3 . Let X denote the vertex set of Γ, and let A denote the adjacency matrix of Γ.
Mark S. MacLean, Štefko Miklavič
semanticscholar +1 more source
Distance-Regular Graphs and Halved Graphs
European Journal of Combinatorics, 1986 Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire +3 more sources
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
Entanglement of free Fermions on Hadamard graphs
Nuclear Physics B, 2020 Free Fermions on vertices of distance-regular graphs are considered. Bipartitions are defined by taking as one part all vertices at a given distance from a reference vertex.
Nicolas Crampé, Krystal Guo, Luc Vinet
doaj +1 more source
On 3-Chromatic Distance-Regular Graphs [PDF]
SSRN Electronic Journal, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aart Blokhuis +2 more
openaire +11 more sources
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source