Sign Up to like & get
recommendations!
1
Published in 2017 at "Journal of Mathematical Chemistry"
DOI: 10.1007/s10910-017-0802-4
Abstract: The atom-bond connectivity (ABC) index of a graph G is defined to be $$ABC(G)=\sum _{uv\in E(G)}\sqrt{\frac{d(u)+d(v)-2}{d(u)d(v)}}$$ABC(G)=∑uv∈E(G)d(u)+d(v)-2d(u)d(v) where d(u) is the degree of a vertex u. The ABC index plays a key role in correlating the…
read more here.
Keywords:
index;
graphs given;
given degree;
index connected ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2017 at "Journal of Applied Mathematics and Computing"
DOI: 10.1007/s12190-016-1022-y
Abstract: The Wiener index is the sum of distances between all pairs of distinct vertices in a connected graph, which is the oldest topological index related to molecular branching. In this article, we give a condition…
read more here.
Keywords:
index;
unicyclic graphs;
graphs given;
wiener index ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2021 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2021.02.011
Abstract: Abstract The maximal energies of line graphs are determined over all graphs with fixed matching number, fractional matching number and bipartiteness, respectively. The extremal graphs are characterized.
read more here.
Keywords:
line graphs;
energy line;
line;
maximal energy ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2023 at "Probability in the Engineering and Informational Sciences"
DOI: 10.1017/s0269964823000128
Abstract: We study site and bond percolation in simple directed random graphs with a given degree distribution. We derive the percolation threshold for the giant strongly connected component and the fraction of vertices in this component…
read more here.
Keywords:
simple directed;
percolation simple;
random graphs;
directed random ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2020 at "Filomat"
DOI: 10.2298/fil2012215z
Abstract: We consider two classes of the graphs with a given bipartition. One is trees and the other is unicyclic graphs. The signless Laplacian coefficients and the incidence energy are investigated for the sets of trees/unicyclic…
read more here.
Keywords:
coefficients incidence;
signless laplacian;
given bipartition;
laplacian coefficients ... See more keywords