نتایج جستجو برای: t pancyclic arc

تعداد نتایج: 736871  

2009
Yonghong Xiang Iain A. Stewart

We prove that a k-ary 2-cube Q2 with 3 faulty edges but where every vertex is incident with at least 2 healthy edges is bipancyclic, if k ≥ 3, and k-pancyclic, if k ≥ 5 is odd (these results are optimal).

Journal: :Journal of Graph Theory 1991
Ronald J. Gould

This is intended as a survey article covering recent developments in the area of hamiltonian graphs, that is, graphs containing a spanning cycle. This article also contains some material on related topics such as traceable, hamiltonian-connected and pancyclic graphs and digraphs, as well as an extensive bibliography of papers in the area. 1. Supported by O.N.R. contract number N000014-88-K-0070.

2008
Jouya JADIDIAN Kaveh NIAYESH Ehsan HASHEMI

Axial Magnetic Field (AMF) is widely used in vacuum interrupters to keep the arc in the diffused mode. With increasing axial magnetic field, the multiple arc mode extends to higher arc currents. In this mode of arc, the fault current can be easily interrupted due to fast recovery of the diffused vacuum arc. The magnetic field amplitudes considered in the preceding studies are all less than hund...

Journal: :Graphs and Combinatorics 1997
Ladislav Stacho

Schmeichel and Hakimi ?], and Bauer and Schmeichel ?] gave an evidence in support of the well-known Bondy's "metaconjecture" that almost any non-trivial condition on graphs which implies that the graph is hamiltonian also implies that it is pancyclic. In particular, they proved that the metaconjecture is valid for Chvv atal's condition ?]. We slightly generalize their results giving a new Chvv ...

Journal: :ITA 2009
Tsong-Jie Lin Sun-Yuan Hsieh Hui-Ling Huang

We study two topological properties of the 5-ary n-cube Qn. Given two arbitrary distinct nodes x and y in Q 5 n, we prove that there exists an x-y path of every length ranging from 2n to 5n−1, where n ≥ 2. Based on this result, we prove that Qn is 5-edge-pancyclic by showing that every edge in Qn lies on a cycle of every length ranging from 5 to 5. Mathematics Subject Classification. 68R10, 68R...

Journal: :Discrete Mathematics 2017
Megan Cream Ronald J. Gould Victor Larsen

We call a graph G pancyclic if it contains at least one cycle of every possible length m, for 3 ≤ m ≤ |V (G)|. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length 4, 5, . . . , |V (G)|. In particular, certain paths and triangles with...

2016
Zina Dubeykovskaya Yiling Si Xiaowei Chen Daniel L. Worthley Bernhard W. Renz Aleksandra M. Urbanska Yoku Hayakawa Ting Xu C. Benedikt Westphalen Alexander Dubeykovskiy Duan Chen Richard A. Friedman Samuel Asfaha Karan Nagar Yagnesh Tailor Sureshkumar Muthupalani James G. Fox Jan Kitajewski Timothy C. Wang

CD11b(+)Gr-1(+) myeloid-derived suppressor cells (MDSCs) expand in the spleen during cancer and promote progression through suppression of cytotoxic T cells. An anti-inflammatory reflex arc involving the vagus nerve and memory T cells is necessary for resolution of acute inflammation. Failure of this neural circuit could promote procarcinogenic inflammation and altered tumour immunity. Here we ...

2009
Steven Bitner Yam K. Cheung Ovidiu Daescu Anastasia Kurdia Carola Wenk

Many surgical procedures could benefit from guiding a bevel-tip needle through a sequence of treatment points in a patient. For example, brachytherapy procedures implant radioactive seeds to treat cancer, and biopsy procedures extract tissue samples to test for cancer. A bevel-tip needle has an asymmetric tip that cuts through tissue along a circular arc. By rotating the needle during its inser...

Journal: :The Computer Science Journal of Moldova 1997
Eleonor Ciurea

This paper presents two problems concerning dynamic flow in node and arc capacitated networks: (1) maximal dynamic flow; (2) feasible dynamic flows. 1 Maximal dynamic flows in arc capacitated networks Let G = (N, A) be a connected digraph with N = {s, . . . , x, . . . , s′}, |N | = n the node set and A = {(x, y)/x, y ∈ N}, |A| = m ≤ n(n − 1) the arc set. Let N be the natural number set and P{0,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید