Results 1 to 10 of about 1,353 (111)
Spanning Trees with Disjoint Dominating and 2-Dominating Sets
Discussiones Mathematicae Graph Theory, 2022 In this paper, we provide a structural characterization of graphs having a spanning tree with disjoint dominating and 2-dominating sets.
Miotk Mateusz, Żyliński Paweł
doaj +1 more source
Graphs with Unique Maximum Packing of Closed Neighborhoods
Discussiones Mathematicae Graph Theory, 2022 A packing of a graph G is a subset P of the vertex set of G such that the closed neighborhoods of any two distinct vertices of P do not intersect. We study graphs with a unique packing of the maximum cardinality. We present several general properties for
Božović Dragana, Peterin Iztok
doaj +1 more source
More on the Minimum Size of Graphs with Given Rainbow Index
Discussiones Mathematicae Graph Theory, 2020 The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand et al., is a natural generalization of the rainbow connection number of a graph.
Zhao Yan
doaj +1 more source
Banhatti, revan and hyper-indices of silicon carbide Si2C3-III[n,m]
Open Chemistry, 2021 In recent years, several structure-based properties of the molecular graphs are understood through the chemical graph theory. The molecular graph GG of a molecule consists of vertices and edges, where vertices represent the atoms in a molecule and edges ...
Zhao Dongming +6 more
doaj +1 more source
On the Distance Spectral Radius of Trees with Given Degree Sequence
Discussiones Mathematicae Graph Theory, 2020 We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth +2 more
doaj +1 more source
A combinatorial expression for the group inverse of symmetric M-matrices
Special Matrices, 2021 By using combinatorial techniques, we obtain an extension of the matrix-tree theorem for general symmetric M-matrices with no restrictions, this means that we do not have to assume the diagonally dominance hypothesis.
Carmona A., Encinas A.M., Mitjana M.
doaj +1 more source
A correction on Shiloach's algorithm for minimum linear arrangement of trees [PDF]
, 2017 More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on subsequent literature.
Esteban, Juan Luis +1 more
core +3 more sources
Discussiones Mathematicae Graph Theory, 2022 A branch at a vertex x in a tree is a maximal subtree containing x as an endvertex. The branch-weight of x is the maximum number of edges in any branch at x.
Shang Jen-Ling
doaj +1 more source
Total Roman {2}-Dominating Functions in Graphs
Discussiones Mathematicae Graph Theory, 2022 A Roman {2}-dominating function (R2F) is a function f : V → {0, 1, 2} with the property that for every vertex v ∈ V with f(v) = 0 there is a neighbor u of v with f(u) = 2, or there are two neighbors x, y of v with f(x) = f(y) = 1.
Ahangar H. Abdollahzadeh +3 more
doaj +1 more source
Saturation Spectrum of Paths and Stars
Discussiones Mathematicae Graph Theory, 2017 A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from G̅ to G results in a copy of H. The minimum size of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum size is the well studied extremal number,
Faudree Jill +4 more
doaj +1 more source