Results 41 to 50 of about 4,390 (196)
ARITHMETICAL RANK OF THE CYCLIC AND BICYCLIC GRAPHS [PDF]
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length connected through a vertex, the arithmetical rank equals the projective dimension of the corresponding quotient ring.
BARILE, Margherita +3 more
openaire +5 more sources
On minimum algebraic connectivity of graphs whose complements are bicyclic
The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao +3 more
doaj +1 more source
The quotients between the (revised) Szeged index and Wiener index of graphs [PDF]
Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order $n\geqslant 10$ are ...
Huihui Zhang, Jing Chen, Shuchao Li
doaj +1 more source
A graph G is said to be nonsingular (resp., singular) if its adjacency matrix A(G) is nonsingular (resp., singular). The inverse of a nonsingular graph G is the unique weighted graph whose adjacency matrix is similar to the inverse of the adjacency matrix A(G) via a diagonal matrix of ±1s.
openaire +1 more source
Animal‐mediated seed dispersal: A review of study methods
Abstract By dispersing seeds, animals provide ecological functions critical for the ecology, evolution, and conservation of plants. We review quantitative and empirical approaches and emerging technologies to quantify processes and patterns of animal‐mediated seed dispersal (zoochory) across its phases: from predispersal to postdispersal.
Noelle G. Beckman +10 more
wiley +1 more source
ABSTRACT Molecules that violate Hund's rule by exhibiting an inverted singlet–triplet gap (STG), where the first excited singlet (S1${\rm S}_1$) lies below the triplet (T1${\rm T}_1$), are rare but hold great promise as efficient fifth‐generation light emitters.
Atreyee Majumdar +1 more
wiley +1 more source
On Omega Index and Average Degree of Graphs
Average degree of a graph is defined to be a graph invariant equal to the arithmetic mean of all vertex degrees and has many applications, especially in determining the irregularity degrees of networks and social sciences.
Sadik Delen +3 more
doaj +1 more source
Degree-Based Entropy of Some Classes of Networks
A topological index is a number that is connected to a chemical composition in order to correlate a substance’s chemical makeup with different physical characteristics, chemical reactivity, or biological activity.
S. Nagarajan +4 more
doaj +1 more source
The Minimal Total Irregularity of Graphs [PDF]
In \cite{2012a}, Abdo and Dimitov defined the total irregularity of a graph $G=(V,E)$ as \hskip3.3cm $\rm irr_{t}$$(G) = \frac{1}{2}\sum_{u,v\in V}|d_{G}(u)-d_{G}(v)|, $ \noindent where $d_{G}(u)$ denotes the vertex degree of a vertex $u\in V$.
Yang, Jieshan, You, Lihua, Zhu, Yingxue
core
The signature of line graphs and power trees
Let $G$ be a graph and let $A(G)$ be the adjacency matrix of $G$. The signature $s(G)$ of $G$ is the difference between the positive inertia index and the negative inertia index of $A(G)$. Ma et al. [Positive and negative inertia index of a graph, Linear
Fan, Yi-Zheng, Wang, Long
core +1 more source

