Results 21 to 30 of about 412,655 (203)

The Extremal Unicyclic Graphs With Given Girth for Exponential VDB Topological Indices

Journal of Mathematics
Topological indices are widely used molecular structure descriptors in chemistry and pharmaceutics, which help analyze and predict the physicochemical properties and biological activity of compounds.
Zhenhua Su, Zikai Tang
doaj   +2 more sources

Contraharmonic Index: Extremal Results for Unicyclic Graphs and Bounds for General Graphs

Journal of Mathematics
Let G be a graph with edge set EG. The degree of a vertex w in G is denoted by dw. The contraharmonic index of G is defined as CHG=∑uv∈EGdu+dv−1du2+dv2.
Abdulaziz Mutlaq Alotaibi, Akbar Ali
doaj   +2 more sources

Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter

Journal of Mathematics
For a connected graph G and two real numbers a,b, the general degree–eccentricity index of G is given by DEIa,bG=∑v∈VGdGavecGbv, where VG represent the vertex set of graph G, dGv denotes the degree of vertex v, and ecGv is the eccentricity of v in G ...
Mesfin Masre
doaj   +2 more sources

Unicyclic graphs with equal Laplacian energy [PDF]

Linear and Multilinear Algebra, 2013
11 pages, 11 figures, slightly modified version of Theorem 1 when compared with original ...
Eliseu Fritscher, Carlos Hoppen, Vilmar Trevisan   +2 more
openaire   +4 more sources

High-ordered spectral characterization of unicyclic graphs [PDF]

, 2022
In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$.
Fan, Yi-Zheng, Zheng, Jian, Yang, Hong-Xia   +2 more
core   +3 more sources

Unicyclic graphs with bicyclic inverses [PDF]

, 2017
summary:A graph is nonsingular if its adjacency matrix $A(G)$ is nonsingular. The inverse of a nonsingular graph $G$ is a graph whose adjacency matrix is similar to $A(G)^{-1}$ via a particular type of similarity.
Panda, Swarup Kumar
core   +2 more sources

Minor-obstructions for apex sub-unicyclic graphs

, 2020
A graph is sub-unicyclic if it contains at most one cycle. A graph G is k-apex sub-unicyclic if it can become sub-unicyclic by removing k of its vertices.
Singh, A., Tsatsanis, K., Thilikos, D.M., Leivaditis, A., Stamoulis, G., Velona, V.   +5 more
core   +3 more sources

The inverse of the incidence matrix of a unicyclic graph [PDF]

Linear and Multilinear Algebra, 2022
The vertex-edge incidence matrix of a (connected) unicyclic graph G is a square matrix which is invertible if and only if the cycle of G is an odd cycle. A combinatorial formula of the inverse of the incidence matrix of an odd unicyclic graph was known.
Hessert, Ryan, Mallik, Sudipta
openaire   +2 more sources

Characterization of Extremal Unicyclic Graphs Using F-Coindex

Complexity, 2021
The study of forgotten index and coindex for the molecular structures of some special chemical graphs (compounds and drugs) has proven significant in medical and pharmaceutical drug design fields by making reliable statistical conclusion about biological
Muhammad Imran, Yasir Ali, Zainab Bibi, Muhammad Saad Ghafar   +3 more
doaj   +1 more source

Binomial edge ideals of unicyclic graphs [PDF]

International Journal of Algebra and Computation, 2021
Let [Formula: see text] be a connected graph on the vertex set [Formula: see text]. Then [Formula: see text]. In this paper, we prove that if [Formula: see text] is a unicyclic graph, then the depth of [Formula: see text] is bounded below by [Formula: see text]. Also, we characterize [Formula: see text] with [Formula: see text] and [Formula: see text].
openaire   +3 more sources