Results 81 to 90 of about 193 (154)
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
Open Mathematics, 2016 As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G.
Shang Yilun
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
Computation of Augmented Zagreb Index and their Polynomial of Certain Class of Windmill Graphs
, 2018 The augmented Zagreb index of a graph G=(V, E) is defined by In this paper, we compute the augmented Zagreb index and their polynomials of certain classes of windmill graphs like French windmill graph, Dutch windmill graph, Kulli cycle windmill graph ...
Diwakar, S. A., Chaluvaraju, B.
core
Random walks on infinite self-similar graphs
, 2008 We introduce a class of rooted infinite self-similar graphs containing the well known Fibonacci graph and graphs associated with Pisot numbers. We consider directed random walks on these graphs and study their entropy and their limit measures.
J. Neunhäuserer
core
Lower bounds on the leaf number in graphs with forbidden subgraphs
, 2017 Let G be a simple, connected graph. The leaf number, L(G) of G, is dened as the maximum number of leaf vertices contained in a spanning tree of G. Assume that G is a triangle-free graph with minimum degree δ, order n and leaf number L(G).
Rodrigues, B.G., Mukwembi, S, Munyira, S
core
On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees. [PDF]
Discrete Appl Math, 2021 Rosenberg NA.
europepmc +1 more source
Symplectic Runge-Kutta Schemes III: Canonical Elementary Differentials
, 1993 . It has been shown that numerical methods for Hamiltonian systems may be characterised in terms of so-called canonical elementary differentials. Recent results by the authors demonstrate that the symplecticity condition for Runge-Kutta schemes may be ...
M. Sofroniou, W. Oevel
core
Completely Independent Spanning Trees in k-Th Power of Graphs
Discussiones Mathematicae Graph Theory, 2018 Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of
Hong Xia
doaj +1 more source
A Linked Cluster Theorem of the Solution of the Generalized Burger Equation
, 2012 In this paper we consider a stochastic partial differential equation defined on a Lattice L δ with coefficients of non-linearity with degree p. An analytic solution in the sense of formal power series is given.
Boubaker Smii
core