Results 101 to 110 of about 3,013 (185)
Further development of F-index for fuzzy graph and its application in Indian railway crime. [PDF]
J Appl Math Comput, 2023 Islam SR, Pal M.
europepmc +1 more source
Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues
Journal of Inequalities and Applications, 2010 Let be a simple graph with vertices, and let be the least eigenvalue of . The connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs.
Xu Guang-Hui
doaj
The Connected Detour Numbers of Special Classes of Connected Graphs
Journal of Mathematics, 2019 Simple finite connected graphs G=V,E of p≥2 vertices are considered in this paper. A connected detour set of G is defined as a subset S⊆V such that the induced subgraph GS is connected and every vertex of G lies on a u−v detour for some u,v∈S.
Ahmed M. Ali, Ali A. Ali
doaj +1 more source
Conjugated tricyclic graphs with maximum variable sum exdeg index. [PDF]
Heliyon, 2023 Rizwan M, Bhatti AA, Javaid M, Shang Y.
europepmc +1 more source
The partition dimension of the vertex amalgamation of some cycles. [PDF]
Heliyon, 2022 Hasmawati +4 more
europepmc +1 more source
A note on the minimum reduced reciprocal Randic index of n-vertex unicyclic graphs
Kuwait Journal of Science, 2017 Recent studies show that the reduced reciprocal Randi? (RRR) index possesses the second-best correlating ability amongthe several well known topological indices.
Akbar Ali, Akhlaq A. Bhatti
doaj
Hosoya Polynomials of Power Graphs of Certain Finite Groups. [PDF]
Molecules, 2022 Rather BA, Ali F, Alsaeed S, Naeem M.
europepmc +1 more source
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
Open MathematicsThe number of jj-matchings in a graph HH is denote by m(H,j)m\left(H,j). If for two graphs H1{H}_{1} and H2{H}_{2}, m(H1,j)≥m(H2,j)m\left({H}_{1},j)\ge m\left({H}_{2},j) for all jj, then we write H1≽H2{H}_{1}\succcurlyeq {H}_{2}.
Bai Yongqiang, Ma Hongping, Zhang Xia
doaj +1 more source
Power Graphs of Finite Groups Determined by Hosoya Properties. [PDF]
Entropy (Basel), 2022 Ali F +4 more
europepmc +1 more source
Reconstructing edge-deleted unicyclic graphs
The Harary reconstruction conjecture states that any graph with more than four edges can be uniquely reconstructed from its set of maximal edge-deleted subgraphs. In 1977, Müller verified the conjecture for graphs with $n$ vertices and $n \log_2(n)$ edges, improving on Lovás's bound of $\log(n^2-n)/4$.
Pizzimenti, Anthony E. +1 more
openaire +2 more sources