Results 81 to 90 of about 112 (100)

Further Results on Monotonic Graph Invariants and Bipartiteness Number

open access: yesQuaestiones Mathematicae, 2019
The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bipartite graph. If a graph invariant decreases or increases with addition of edges of its complement, then it is called a monotonic graph invariant.
Jia-Bao Liu, Hanlin Chen
exaly   +1 more source
Some of the next articles are maybe not open access.

Related searches:

Survey on the General Randić Index: Extremal Results and Bounds

Rocky Mountain Journal of Mathematics, 2022
Tomáš Vetrík
exaly  

General Multiplicative Zagreb Indices of Trees With Given Independence Number

Quaestiones Mathematicae, 2021
Tomáš Vetrík, Selvaraj Balachandran
exaly  

Some New Degree Based Topological Indices via M-Polynomial

Journal of Information and Optimization Sciences, 2020
Deeba Afzal   +2 more
exaly  

On Reciprocal Leap Function of Graph

Journal of Discrete Mathematical Sciences and Cryptography, 2021
Anwar Alwardi, Ammar Alsinai
exaly  

M-Polynomial and Topological Indices Poly (EThyleneAmidoAmine) Dendrimers

Journal of Information and Optimization Sciences, 2020
Deeba Afzal   +2 more
exaly  

On Some Degree Based Topological Indices of Mk-Graph

Journal of Discrete Mathematical Sciences and Cryptography, 2020
Nilanjan De   +2 more
exaly  

A Study of Novel Harmonic Indices in Nanocones CNCk[n]

Journal of Discrete Mathematical Sciences and Cryptography, 2019
Mehdi Alaeiyan
exaly  

On Ve-Degree Molecular Properties of Copper Oxide

Journal of Information and Optimization Sciences, 2020
Murat Cancan   +2 more
exaly  

On Modified Eccentric Connectivity Index of Nanotube

Journal of Information and Optimization Sciences, 2020
Muhammad Shoaib Sardar   +2 more
exaly  

Home - About - Disclaimer - Privacy