Results 31 to 40 of about 504 (100)
Non-commuting graph of the dihedral group determined by Hosoya parameters
Hosoya introduced the concept of graph terminologies in chemistry and provide a modeling for molecules. This modeling leads to predict the chemical properties of molecules, easy classification of chemical compounds, computer simulations and computer ...
Muhammad Salman +4 more
doaj +1 more source
Some inequalities for the multiplicative sum Zagreb index of graph operations
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
On Order Prime Divisor Graphs of Finite Groups
The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K. +2 more
doaj +1 more source
A STUDY OF INERTIA INDICES, SIGNATURE AND NULLITY OF V-PHENYLENIC $[m,n]$
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
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
$M$-POLYNOMIALS AND TOPOLOGICAL INDICES OF SILICATE AND OXIDE NETWORKS
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
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
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
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]
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

