Results 21 to 30 of about 504 (100)
Computational Analysis of new Degree-based descriptors of oxide networks
Open Chemistry, 2019 Oxide networks have diverse applications in the polymer and pharmaceutical industries. Polynomials and degree-based topological indices have tendencies to correlate properties of molecular graphs.
Hussain Zafar +5 more
doaj +1 more source
Equating κ Maximum Degrees in Graphs without Short Cycles
Discussiones Mathematicae Graph Theory, 2020 For an integer k at least 2, and a graph G, let fk(G) be the minimum cardinality of a set X of vertices of G such that G − X has either k vertices of maximum degree or order less than k.
Fürst Maximilian +4 more
doaj +1 more source
More on Comparison Between First Geometric-Arithmetic Index and Atom-Bond Connectivity Index [PDF]
, 2015 The first geometric-arithmetic (GA) index and atom-bond connectivity (ABC) index are molecular structure descriptors which play a significant role in quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship ...
Akbar Ali +3 more
core +2 more sources
The H-force sets of the graphs satisfying the condition of Ore’s theorem
Open Mathematics, 2020 Let G be a Hamiltonian graph. A nonempty vertex set X⊆V(G)X\subseteq V(G) is called a Hamiltonian cycle enforcing set (in short, an H-force set) of G if every X-cycle of G (i.e., a cycle of G containing all vertices of X) is a Hamiltonian cycle.
Zhang Xinhong, Li Ruijuan
doaj +1 more source
EXTREMAL HYPER ZAGREB INDEX FOR TRICYCLIC GRAPHS
, 2020 For a graph G = (V (G), E(G)), the first hyper Zagreb index is defined as ∑ uv∈E(G)(d(u) + d(v)) 2, where d(v) is the degree of the vertex v. The hyper Zagreb index is a kind of extensions of Zagreb index.
Zheng-Qing Chu, M. Jamil, Aisha Javed
semanticscholar +1 more source
The Second Neighbourhood for Bipartite Tournaments
Discussiones Mathematicae Graph Theory, 2019 Let T (X ∪ Y, A) be a bipartite tournament with partite sets X, Y and arc set A. For any vertex x ∈ X ∪Y, the second out-neighbourhood N++(x) of x is the set of all vertices with distance 2 from x.
Li Ruijuan, Sheng Bin
doaj +1 more source
The multiplicative Zagreb indices of graph operations
, 2013 Recently, Todeschini et al. (Novel Molecular Structure Descriptors - Theory and Applications I, pp. 73-100, 2010), Todeschini and Consonni (MATCH Commun. Math. Comput. Chem.
K. Das +4 more
semanticscholar +1 more source
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph G of order n is implicit claw-heavy if in every induced copy of K1,3 in G there are two non-adjacent vertices with sum of their implicit degrees at least n. We study various implicit degree conditions (including, but not limiting to, Ore- and Fan-
Zheng Wei, Wideł Wojciech, Wang Ligong
doaj +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. R. Kumar
semanticscholar +1 more source
, 2015 A \textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of
C. Susanth +4 more
core +1 more source