Results 31 to 40 of about 532 (122)
Some inequalities for the multiplicative sum Zagreb index of graph operations
, 2015 The multiplicative sum Zagreb index is defined for a simple graph G as the product of the terms dG(u)+dG(v) over all edges uv∈E(G) , where dG(u) denotes the degree of the vertex u of G .
M. Azari, A. Iranmanesh
semanticscholar +1 more source
EMBEDDING OF COMPLETE MULTIPARTITE GRAPHS INTO CYCLE-OF-LADDERS
, 2020 Graph embedding is the mapping of a topological structure (guest graph) into another topological structure (host graph) that preserves certain required topological properties and the graph embedding ability reflects how efficiently a parallel algorithm ...
Jiangxia Liu, R. Karthik, S. Kumar
semanticscholar +1 more source
$M$-POLYNOMIALS AND TOPOLOGICAL INDICES OF SILICATE AND OXIDE NETWORKS
, 2017 A topological index is a numeric quantity that characterizes the whole structure of a molecular graph of the chemical compound and helps to understand its physical features, chemical reactivities and boiling activities.
M. Javaid, C. Jung
semanticscholar +1 more source
A STUDY OF INERTIA INDICES, SIGNATURE AND NULLITY OF V-PHENYLENIC $[m,n]$
, 2020 A molecular/chemical graph is hydrogen depleted chemical structure in which vertices denote atoms and edges denote the bonds. Topological descriptors are the numerical indices based on the topology of the atoms and their bonds (chemical conformation ...
Zheng-Qing Chu +3 more
semanticscholar +1 more source
Bounds for The Geometric-Arithmetic Index of a Graph
, 2015 The first geometric-arithmetic index GA1.G/, which was introduced by D. Vukičević and B. Furtula recently, is a graph-based molecular structure descriptor.
J. Sigarreta
semanticscholar +1 more source
The upper bounds for multiplicative sum Zagreb index of some graph operations
, 2017 Let G be a simple graph with vertex set V(G) and edge set E(G). In [7], Eliasi et al. introduced the multiplicative sum Zagreb index of a graph G which is denoted by Π1(G) and is defined by Π1(G) = ∏ uv∈V (G) (dG(u)+dG(v)) .
Yasar Nacaroglu, A. Maden
semanticscholar +1 more source
Discrete Mathematics & Theoretical Computer Science, 2018 We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$.
Michael D. Barrus
doaj +1 more source
مجلة بغداد للعلوم, 2023 This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η ...
ARCHANA S., PREETHI KUTTIPULACKAL
doaj +1 more source
On the Harary index of graph operations
, 2013 The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, expressions for the Harary indices of the join, corona product, Cartesian product, composition and disjunction of graphs
K. Das +4 more
semanticscholar +1 more source
Open k-monopolies in graphs: complexity and related concepts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Closed monopolies in graphs have a quite long range of applications in several problems related to overcoming failures, since they frequently have some common approaches around the notion of majorities, for instance to consensus problems, diagnosis ...
Dorota Kuziak +2 more
doaj +1 more source