نتایج جستجو برای: center steiner harary index
تعداد نتایج: 670387 فیلتر نتایج به سال:
We generalize the Harary-Sachs theorem to k-uniform hypergraphs: codegree-d coefficient of characteristic polynomial a uniform hypergraph H can be expressed as weighted sum subgraph counts over certain multi-hypergraphs with d edges. include detailed description aforementioned and formula for their corresponding weights.
Given a weighted graph G = (V,E) and a subset R of V , a Steiner tree in G is a tree which spans all vertices in R. The vertices in V \R are called Steiner vertices. A full Steiner tree is a Steiner tree in which each vertex of R is a leaf. The full Steiner tree problem is to find a full Steiner tree with minimum weight. The bottleneck full Steiner tree problem is to find a full Steiner tree wh...
Christoph Kaether, Johanna Scheuermann, Matthias Fassler, Sonja Zilow, Keiro Shirotani, Christina Valkova, Bozidar Novak, Slavomir Kacmar, Harald Steiner & Christian Haass 1Laboratory for Alzheimer’s and Parkinson’s Disease Research, Department of Biochemistry, Center For Integrated Protein Science Munich and Adolf-Butenandt-Institute, Ludwig-Maximilians-Universität, München, Germany, and 2Leib...
Topological indices are the numerical value associated with chemical constitution purporting for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. Graph theory is a delightful playground for the exploration of proof techniques in Discrete Mathematics and its results have applications in many areas of sciences. One of the useful indic...
Elaine Liu, Kevin Lewis, Hiba Al-Saffar, Catherine M. Krall, Anju Singh, Vladimir A. Kulchitsky, Joshua J. Corrigan, Christopher T. Simons, Scott R. Petersen, Florin M. Musteata, Chandra S. Bakshi, Andrej A. Romanovsky, Timothy J. Sellati, and Alexandre A. Steiner Department of Pharmaceutical Sciences, Albany College of Pharmacy and Health Sciences, Albany, New York; Center for Immunology and M...
The 2-parallel chromatic index X" (8) is the minimum number of colours required to colour the blocks of a Steiner triple system 8 so that any two parallel blocks receive different colours. The value of X" (v) = min {X" (8) : 8 is an 8TS(v)} is determined for all admissible v.-It is further shown how the 2-parallel chromatic index is related to the independence number and a complete analysis for...
We present new functional equations connecting the counting series of plane and planar (in the sense of Harary and Palmer) dissections. Simple rigorous expressions for counting symmetric r-dissections of polygons and planar S-dissections are obtained.
In this paper we will investigate the edge-chromatic automorphism groups for two classes of graphs. Chromatic automorphism groups have been studied by a number of people, including Chvatal [4] and Baumann et al. [l, 21. Characterizations will be given for these groups. Note that all arithmetic will be done modp, p not necessarily prime. The particular p will be clear from the context. These gra...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید