نتایج جستجو برای: free spanning

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

Journal: :Discrete Mathematics 2007
Hong-Jian Lai Xiangjuan Yao

If G is a 2-connected bipartite biclaw-free graph with (G) 4, then by [2, Lemma 2.2], every edge of G lies in a 4-cycle, and then by Lemma 2.5 (the correct version), G is collapsible. It follows that G will have a spanning eulerian subgraph. Note that a Hamiltonian cycle of G is a spanning eulerian subgraph of G with maximum degree 2. We consider it one possible way to attack Conjecture 1.1 of ...

Journal: :J. Comb. Theory, Ser. B 1997
Zdenek Ryjácek

If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A suucient condition for hamiltonicity in claw-free graphs, the equivalence of some conjectures on hamiltonicity in 2-tough graphs and the hamiltonicity of 7-connected c...

Journal: :Optics letters 2014
Tobias Hansson Daniele Modotto Stefan Wabnitz

We numerically study the mechanisms of frequency comb generation in the mid-infrared spectral region from cw-pumped silicon microring resonators. Coherent soliton comb generation may be obtained even for a pump with zero linear cavity detuning, through suitable control of the effective lifetime of free carriers from multiphoton absorption, which introduces a nonlinear cavity detuning via free-c...

2010
S. JOHN PETER

Clustering is a process of discovering groups of objects such that the objects of the same group are similar, and objects belonging to different groups are dissimilar. A number of clustering algorithms exist that can solve the problem of clustering, but most of them are very sensitive to their input parameters. Minimum Spanning Tree clustering algorithm is capable of detecting clusters with irr...

Journal: :J. Parallel Distrib. Comput. 2001
Honge Wang Douglas M. Blough

A tree-based multicast algorithm for wormhole-switched networks which makes use of multiple edge-disjoint spanning trees is presented. The disjoint spanning-tree multicast, or DSTM, algorithm provides deadlock-free multicast routing that is fully compatible with unicast. Application of the DSTM algorithm to 2-dimensional torus networks is considered. A family of constructions of two spanning tr...

Journal: Pollution 2020
G. Edusei, J. B. Tandoh O. Gyampo R. Edziah

Mitigation of atmospheric pollution has been a topic of concern over the past decades. In this study, tree rings have been used to reconstruct past climates as well as to assess the effects of recent climatic and environmental changes on tree growth. Vehicular emission is one of the major sources of pollutants in the atmosphere and this study focused on the Haatso-Atomic road which over the yea...

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

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