Results 91 to 100 of about 314 (174)

The determinant of a unicyclic graph’s neighborhood matrix

Linear Algebra and its Applications, 2005
Let \(G\) be a unicyclic graph with \(n\) vertices and a unique cycle, \(A(G)\) denotes the adjacency matrix of the graph \(G\). The algorithm for computing the determinant function of the matrix \(\alpha I_n+A(G)\) which uses \(O(n)\) arithmetic operations under some restrictions on the degrees of the vertices of the graph \(G\) is obtained. Among the
openaire   +2 more sources

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  

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

The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two

Open Mathematics
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

Conjugated tricyclic graphs with maximum variable sum exdeg index. [PDF]

Heliyon, 2023
Rizwan M, Bhatti AA, Javaid M, Shang Y.
europepmc   +1 more source

Reconstructing edge-deleted unicyclic graphs

CoRR
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$.
Anthony E. Pizzimenti, Umarkhon Rakhimov
openaire   +2 more sources

On the spectral radius of atom-bond maximum degree-based sum-connectivity matrix and its applications as molecular descriptors

Kuwait Journal of Science
matrices have been extensively studied. One of the modified versions of Randić index is the index 𝑅′ (𝐺) = ∑ 𝑣𝑖∼𝑣𝑗 1 / max{𝑑𝑖 , 𝑑𝑗 } , where 𝑑𝑖 and 𝑑𝑗 are the vertex degrees of 𝑣𝑖 and 𝑣𝑗 , respectively.
B.R. Rakshith, L. Yashaswini, Kinkar Chandra Das   +2 more
doaj   +1 more source

Laplacian eigenvalue distribution for unicyclic graphs

Applied Mathematics and Computation
Let $G$ be a unicyclic graph. In this paper, we provide an upper bound for the number of Laplacian eigenvalues of $G$ within the interval $[0,1)$ in terms of the diameter and the girth of $G$.
Sunyo Moon, Seungkook Park
openaire   +3 more sources

The partition dimension of the vertex amalgamation of some cycles. [PDF]

Heliyon, 2022
Hasmawati, Hinding N, Nurwahyu B, Syukur Daming A, Kamal Amir A.   +4 more
europepmc   +1 more source

Zonal Labeling of Graphs

Indonesian Journal of Combinatorics
A planar graph is said to be zonal when is possible to label its vertices with the nonzero elements of ℤ3, in such a way that the sum of the labels of the vertices on the boundary of each zone is 0 in ℤ3.
Christian Barrientos, Sarah Minion
doaj   +1 more source