Results 61 to 70 of about 1,401 (109)
The generalized minimum spanning tree polytope and related polytopes [PDF]
, 2001 The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each ...
Pop, P.C.
core +1 more source
Further generalization of symmetric multiplicity theory to the geometric case over a field
Special Matrices, 2021 Using the recent geometric Parter-Wiener, etc. theorem and related results, it is shown that much of the multiplicity theory developed for real symmetric matrices associated with paths and generalized stars remains valid for combinatorially symmetric ...
Cinzori Isaac +3 more
doaj +1 more source
Generalized 4-connectivity of hierarchical star networks
Open Mathematics, 2022 The connectivity is an important measurement for the fault-tolerance of a network. The generalized connectivity is a natural generalization of the classical connectivity. An SS-tree of a connected graph GG is a tree T=(V′,E′)T=\left(V^{\prime} ,E^{\prime}
Wang Junzhen, Zou Jinyu, Zhang Shumin
doaj +1 more source
The Sanskruti index of trees and unicyclic graphs
Open Chemistry, 2019 The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align*}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align*}$$where sG(u) is the sum of the degrees of the neighbors of a ...
Deng Fei +6 more
doaj +1 more source
Limit laws for two distance-based indices in random recursive tree models
Acta Universitatis Sapientiae: Informatica, 2022 In this paper, we derive several results related to total path length and Sackin index in two classes of random recursive trees. A limiting distribution of the normalized version of the Sackin index is given by the contraction method in random recursive ...
Naderi Sarkoat +2 more
doaj +1 more source
The $(k,\ell)$-rainbow index of random graphs [PDF]
, 2013 A tree in an edge colored graph is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\ell$ with $k\geq 3$, the \emph{$(k,\ell)$-rainbow index} $rx_{k,\ell}(G)$ of $G$ is the minimum number of ...
Cai, Qingqiong +2 more
core
On Double-Star Decomposition of Graphs
Discussiones Mathematicae Graph Theory, 2017 A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence (k1 + 1, k2 + 1, 1, . . . , 1) is denoted by Sk1,k2. We study the edge-decomposition of graphs into double-stars.
Akbari Saieed +3 more
doaj +1 more source
Gaps in the Saturation Spectrum of Trees
Discussiones Mathematicae Graph Theory, 2019 A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from the complement of G to G results in a copy of H. The minimum number of edges (the size) of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum ...
Horn Paul +3 more
doaj +1 more source
Packing Coloring of Some Undirected and Oriented Coronae Graphs
Discussiones Mathematicae Graph Theory, 2017 The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya +2 more
doaj +1 more source
On the sandpile model of modified wheels II
Open Mathematics, 2020 We investigate the abelian sandpile group on modified wheels Wˆn{\hat{W}}_{n} by using a variant of the dollar game as described in [N. L. Biggs, Chip-Firing and the critical group of a graph, J. Algebr. Comb. 9 (1999), 25–45].
Raza Zahid +3 more
doaj +1 more source