Bicyclic graphs with extremal degree resistance distance
, 2016 Let $r(u,v)$ be the resistance distance between two vertices $u, v$ of a simple graph $G$, which is the effective resistance between the vertices in the corresponding electrical network constructed from $G$ by replacing each edge of $G$ with a unit resistor. The degree resistance distance of a simple graph $G$ is defined as ${D_R}(G) = \sum\limits_{\{u,
Liu, Jia-Bao +4 more
openaire +2 more sources
Extremal unicyclic and bicyclic graphs of the Euler Sombor index
AIMS MathematicsTopological indices are widely used to analyze and predict the physicochemical properties of compounds, and have good application prospects. Recently, the Euler Sombor index was introduced, which is defined as \begin{document}$ \begin{align} EP(G ...
Zhenhua Su, Zikai Tang
doaj +1 more source
The Laplacian eigenvalue 2 of bicyclic graphs
, 2019 If $G$ is a graph, its Laplacian is the difference between diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs $G_{1}$ and $G_{2}$ is a graph $G=G_{1}\odot G_{2}$ with $V(G)=V(G_{1})\cup V(G_{2})$ and $E(G)= E(G_{1})\cup E(G_{2})\cup \{e=uv\}$ where $u\in V(G_1)$ and $v\in V(G_2)$.
Mojdeh, Doost Ali +2 more
openaire +2 more sources
On signless Laplacian coefficients of bicyclic graphs
, 2012 22 pages, 3 figures.
Zhang, Jie, Zhang, Xiao-Dong
openaire +2 more sources
On Some Distance Spectral Characteristics of Trees
AxiomsGraham and Pollack in 1971 presented applications of eigenvalues of the distance matrix in addressing problems in data communication systems. Spectral graph theory employs tools from linear algebra to retrieve the properties of a graph from the spectrum ...
Sakander Hayat +2 more
doaj +1 more source
MAXIMUM IRREGULARITY OF TOTALLY SEGREGATED ∞-BICYCLIC GRAPHS
Far East Journal of Mathematical Sciences (FJMS), 2020 T.F. Jorry, K.S. Parvathy
openaire +1 more source
On the multiplicative sum Zagreb index of molecular graphs
Open MathematicsMultiplicative sum Zagreb index is a modified version of the famous Zagreb indices. For a graph GG, the multiplicative sum Zagreb index is defined as Π1*(G)=∏uv∈E(G)(dG(u)+dG(v)){\Pi }_{1}^{* }\left(G)={\prod }_{uv\in E\left(G)}\left({d}_{G}\left(u)+{d}_{
Sun Xiaoling, Du Jianwei, Mei Yinzhen
doaj +1 more source
High-throughput electronic property prediction of cyclic molecules with 3D-enhanced machine learning. [PDF]
Chem SciZheng P, Isayev O.
europepmc +1 more source
Bicyclic temporin L peptide inhibitors targeting the SARS-CoV-2 main protease: design, synthesis, <i>in vitro</i> inhibition efficiency and molecular dynamics insights. [PDF]
RSC Med ChemSharif MT +5 more
europepmc +1 more source
Stability of bicyclic guanidine superbases and their salts in water. [PDF]
RSC AdvGazagnaire E +6 more
europepmc +1 more source