Results 31 to 40 of about 30,403 (170)
On bounds for topological descriptors of φ-sum graphs
Journal of Taibah University for Science, 2020 The properties of chemical compounds are very important for the studies of the non-isomorphism phenomenon's related to the molecular graphs. Topological indices (TIs) are one of the mathematical tools which are used to study these properties.
Yu-Ming Chu +3 more
doaj +1 more source
On the total vertex irregularity strength of comb product of two cycles and two stars
Indonesian Journal of Combinatorics, 2020 Let G = (V(G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V ∪ E → {1,2,3,...,k}. The vertex weight v under the labeling f is denoted by w_f(v) and defined by w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}.
Rismawati Ramdani
doaj +1 more source
On the partition dimension of comb product of path and complete graph [PDF]
AIP Conference Proceedings, 2017 For a vertex v of a connected graph G(V, E) with vertex set V(G), edge set E(G) and S ⊆ V(G). Given an ordered partition Π = {S1, S2, S3, …, Sk} of the vertex set V of G, the representation of a vertex v ∈ V with respect to Π is the vector r(v|Π) = (d(v, S1), d(v, S2), …, d(v, Sk)), where d(v, Sk) represents the distance between the vertex v and the ...
null Darmaji, Ridho Alfarisi
openaire +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
Properly coloured copies and rainbow copies of large graphs with small maximum degree [PDF]
, 2010 Let G be a graph on n vertices with maximum degree D. We use the Lov\'asz local lemma to show the following two results about colourings c of the edges of the complete graph K_n. If for each vertex v of K_n the colouring c assigns each colour to at most (
Böttcher, Julia +2 more
core +1 more source
Bound of Distance Domination Number of Graph and Edge Comb Product Graph
Journal of Physics: Conference Series, 2017 Let G = (V, E) be a simple, nontrivial, finite, connected and undirected graph. For an integer 1 ≤ k ≤ diam(G), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G)\S is at distance at most k from some vertex of S. The k-domination number, denoted by γ k (G), of G is the minimum cardinality of a
Gembong A.W +3 more
openaire +1 more source
More Results on Italian Domination in Cn□Cm
Mathematics, 2020 Italian domination can be described such that in an empire all cities/vertices should be stationed with at most two troops. Every city having no troops must be adjacent to at least two cities with one troop or at least one city with two troops.
Hong Gao +3 more
doaj +1 more source
Asymptotics of the Euler number of bipartite graphs
, 2007 We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima.
Ehrenborg +4 more
core +1 more source
Walk entropies on graphs [PDF]
, 2014 Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
de la Peña, José A. +2 more
core +1 more source
Major Reference Works, Page 290-301., 2021 International Tables for Crystallography is the definitive resource and reference work for crystallography and structural science.
Each of the eight volumes in the series contains articles and tables of data relevant to crystallographic research and to applications of crystallographic methods in all sciences concerned with the ...
John P. Sutter C. Chantler +2 more
wiley +1 more source