Results 1 to 10 of about 262 (120)
ON MULTIPLICATIVE K BANHATTI INDICES OF LINE GRAPHS
Scholarly Research Journal for Interdisciplinary Studies, 2021 Let G = (V,E) be a connected graph. The multiplicative K Banhatti indices of G are defined as BΠ*(G) = Que[dG(u) * dG(e)], where * is usual addition or multiplication and ue means that the vertex u and edge e are incident in G.
B. Manjunath
semanticscholar +1 more source
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
Enveloping algebras of Hom-Lie algebras [PDF]
, 2007 Enveloping algebras of Hom-Lie and Hom-Leibniz algebras are constructed.
Donald Yau
semanticscholar +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
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
Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka +5 more
doaj +1 more source
Zagreb Polynomials and Redefined Zagreb indices for the Line Graph of Carbon Nanocones
Open Journal of Mathematical Analysis, 2018 A line graph has many useful applications in physical chemistry. Topological indices are numerical parameters associated to a structure and, in combination, determine properties of the concerned material.
Saba Noreen, Atif Mahmood
semanticscholar +1 more source
On death processes and urn models [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We use death processes and embeddings into continuous time in order to analyze several urn models with a diminishing content. In particular we discuss generalizations of the pill's problem, originally introduced by Knuth and McCarthy, and generalizations
Markus Kuba, Alois Panholzer
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