Results 41 to 50 of about 1,119 (95)
On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k [PDF]
, 2009 It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.Comment: 3 ...
Adamus, Janusz
core
Walks in Path Graph on Four Vertices and Fibonacci Sequence
, 2017 Using elementary knowledge of graph theory, we show that a path graph on four vertices exhibits Fibonacci structure. For arbitrary start and end vertices, the number of walks of any length is given by a Fibonacci number.
Radim Hošek
semanticscholar +1 more source
Veterinary Dermatology, Volume 35, Issue 6, Page 595-604, December 2024.Background – Mycobacterium cell wall fraction (MCWF) is derived from nonpathogenic Mycobacterium phlei and is used as an immunomodulatory compound in clinical practice, yet its mode‐of‐action requires further research. Objective – To evaluate the host response to MCWF in canine peripheral blood mononuclear cells (PBMCs) by using enzyme‐linked ...
Robert Ward +9 more
wiley +1 more source
The complete positivity of symmetric tridiagonal and pentadiagonal matrices
Special Matrices, 2022 We provide a decomposition that is sufficient in showing when a symmetric tridiagonal matrix AA is completely positive. Our decomposition can be applied to a wide range of matrices.
Cao Lei, McLaren Darian, Plosker Sarah
doaj +1 more source
Cycles in Random Bipartite Graphs [PDF]
, 2013 In this paper we study cycles in random bipartite graph $G(n,n,p)$. We prove that if $p\gg n^{-2/3}$, then $G(n,n,p)$ a.a.s. satisfies the following. Every subgraph $G'\subset G(n,n,p)$ with more than $(1+o(1))n^2p/2$ edges contains a cycle of length $t$
Shang, Yilun
core
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
, 2014 In 1992, Manoussakis conjectured that a strongly 2-connected digraph $D$ on $n$ vertices is hamiltonian if for every two distinct pairs of independent vertices $x,y$ and $w,z$ we have $d(x)+d(y)+d(w)+d(z)\geq 4n-3$.
Ning, Bo
core +1 more source
Homomorphic Preimages of Geometric Paths
Discussiones Mathematicae Graph Theory, 2018 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A geometric graph Ḡ is a simple graph G together with a straight line drawing of G in the plane with the vertices in
Cockburn Sally
doaj +1 more source
An alternative proof of the nowhere-zero 6-flow theorem [PDF]
, 2001 The nowhere-zero 6-flow theorem of Seymour is proven by ...
Hoede, C., Uttunggadewa, S.
core +2 more sources
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source
Distance-Local Rainbow Connection Number
Discussiones Mathematicae Graph Theory, 2022 Under an edge coloring (not necessarily proper), a rainbow path is a path whose edge colors are all distinct. The d-local rainbow connection number lrcd(G) (respectively, d-local strong rainbow connection number lsrcd(G)) is the smallest number of colors
Septyanto Fendy, Sugeng Kiki A.
doaj +1 more source