Results 51 to 60 of about 105 (94)
Discrete Applied Mathematics, 2007 A graph \(G\) is said to be geodesic-pancyclic if every path of length \(d\) between any two vertices \(u\) and \(v\) at distance \(d\) (i.e., the shortest path between \(u\) and \(v\)) can be completed to a cycle of length \(\ell\) for every \(\ell=\max\{2d,3\},\dots,n\).
Hung-Chang,C. A. +3 more
openaire +2 more sources
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
Discrete Mathematics, 1995 A digraph is semicomplete if it has no pair of non-adjacent vertices. A semicomplete multipartite digraph is a digraph that can be obtained from some semicomplete digraph \(D\) by choosing a (vertex) spanning collection of vertex disjoint induced subgraphs of \(D\) and deleting all arcs inside each of these.
openaire +6 more sources
A Note on the Ramsey Number of Even Wheels Versus Stars
Discussiones Mathematicae Graph Theory, 2018 For two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N, such that for any graph on N vertices, either G contains G1 or Ḡ contains G2. Let Sn be a star of order n and Wm be a wheel of order m + 1.
Haghi Sh., Maimani H.R.
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1976 AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancyclic unless it is one of the graphs Kp,p. This generalizes a result of A. Ghouila-Houri. We disprove a conjecture of J. A. Bondy by showing that there exist hamiltonian digraphs with n vertices and 12n(n + 1) – 3 edges which are not pancyclic.
Häggkvist, Roland, Thomassen, Carsten
openaire +2 more sources
Extremal Results on ℓ-Connected Graphs or Pancyclic Graphs Based on Wiener-Type Indices
MathematicsA graph of order n is called pancyclic if it contains a cycle of length y for every 3≤y≤n. The connectivity of an incomplete graph G, denoted by κ(G), is min{|W||WisavertexcutofG}. A graph G is said to be ℓ-connected if the connectivity κ(G)≥ℓ.
Jing Zeng, Hechao Liu, Lihua You
doaj +1 more source
Pancyclicity of hamiltonian line graphs
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Blanken, E. +2 more
openaire +1 more source
Discrete Mathematics, 2001 Suppose \(k\) and \(n\) are integers such that \(3\leq k\leq n\). If \(3\leq k\leq\sqrt{n+1}\), let \(h(k)= (n+ 1)/k+ (k- 4)/2\) if \(k\) is even and let \(h(k)= (n+ 2)/k+ (k-5)/2\) if \(k\) is odd. If \(\sqrt{n+1}< k\leq n\), let \(h(k)= 3n/(2k+ 2)- 1/2\).
openaire +2 more sources
Patient-specific, echocardiography compatible flow loop model of aortic valve regurgitation in the setting of a mechanical assist device. [PDF]
Front Cardiovasc Med, 2023 Kassi M +7 more
europepmc +1 more source
Cycle-pancyclism in bipartite tournaments I
Discussiones Mathematicae Graph Theory, 2004 Summary: Let \(T\) be a Hamiltonian bipartite tournament with \(n\) vertices, \(\gamma\) a Hamiltonian directed cycle of \(T\), and \(k\) an even number. In this paper, the following question is studied: What is the maximum intersection with \(\gamma\) of a directed cycle of length \(k\) contained in \(T[V(\gamma)]\)? It is proved that for an even \(k\)
openaire +3 more sources
First Transfemoral Implantation of a Novel Transcatheter Valve in an LVAD Patient With Aortic Insufficiency. [PDF]
JACC Case Rep, 2021 Ranard LS +9 more
europepmc +1 more source