Results 91 to 100 of about 298 (175)
Further development of F-index for fuzzy graph and its application in Indian railway crime. [PDF]
Islam SR, Pal M.
europepmc +1 more source
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
The 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
The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al.
Wang Yi +3 more
doaj +1 more source
Conjugated tricyclic graphs with maximum variable sum exdeg index. [PDF]
Rizwan M, Bhatti AA, Javaid M, Shang Y.
europepmc +1 more source
The partition dimension of the vertex amalgamation of some cycles. [PDF]
Hasmawati +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
Hosoya Polynomials of Power Graphs of Certain Finite Groups. [PDF]
Rather BA, Ali F, Alsaeed S, Naeem M.
europepmc +1 more source
On Hamiltonian Decomposition Problem of 3-Arc Graphs. [PDF]
Xu G, Sun Q, Liang Z.
europepmc +1 more source
Spectral properties of a class of unicyclic graphs. [PDF]
Du Z.
europepmc +1 more source
Power Graphs of Finite Groups Determined by Hosoya Properties. [PDF]
Ali F +4 more
europepmc +1 more source

