Results 91 to 100 of about 4,390 (196)
Physiological Reports, Volume 14, Issue 3, February 2026.Abstract Estimating minute ventilation (V̇E) is essential for assessing the health impacts of environmental exposures during exercise field‐studies. Predictive equations using heart rate (HR) are commonly used, but overlook exercise intensity domains, and reduced accuracy is shown, particularly for females.
Gustavo Oneda +7 more
wiley +1 more source
Bicyclic graphs with exactly two main eigenvalues
Linear Algebra and its Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Zhiquan, Li, Shuchao, Zhu, Chunfeng
openaire +2 more sources
Bicyclic graphs with maximal revised Szeged index
Discrete Applied Mathematics, 2013 The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\sum_{e=uv \in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of ...
Li, Xueliang, Liu, Mengmeng
openaire +2 more sources
LOCAL IRREGULARITY VERTEX COLORING OF BICYCLIC GRAPH FAMILIES
BarekengThe graph in this research is a simple and connected graph with as vertex set and as an edge set. We used deductive axiomatic and pattern recognition method.
Arika Indah Kristiana +5 more
doaj +1 more source
On the existence of non-golden signed graphs
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2018 A signed graph is a pair Γ=(G,σ), where G=(V(G), E(G)) is a graph and σ: E(G) → {+1, -1} is the sign function on the edges of G. For a signed graph we consider the least eigenvalue λ(Γ) of the Laplacian matrix defined as L(Γ)=D(G)-A(Γ), where D(G) is the
Maurizio Brunetti
doaj +1 more source
Bicyclic graphs with maximum degree resistance distance
Filomat, 2016 Graph invariants, based on the distances between the vertices of a graph, are widely used in theoretical chemistry. Recently, Gutman, Feng and Yu (Transactions on Combinatorics, 01 (2012) 27- 40) introduced the degree resistance distance of a graph G, which is defined as DR(G) = ?{u,v}?V(G)[dG(u)+dG(v)]RG(u,v), where dG(u) is the degree of
Junfeng Du, Jianhua Tu
openaire +2 more sources
Extremal unicyclic and bicyclic graphs with respect to the -index
AKCE International Journal of Graphs and Combinatorics, 2017 In the study of structure-dependency of the total -electron energy in 1972, it was shown that this energy depends on the degree based sum and , where is the degree of a vertex of under consideration molecular graph .
Shehnaz Akhter +2 more
doaj +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
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
On Distance Laplacian Energy of Unicyclic and Bicyclic Graphs
AxiomsFor a connected graph G, let DL(G) be its distance Laplacian matrix and λ1(G)≥λ2(G)≥…≥λn−1(G)>λn(G)=0 be its DL eigenvalues. The DL energy of G is defined as DLEG=∑i=1nλi(G)−2WGn, where W(G) is the Wiener index of G.
Dan Li, Shiqi Zhou
doaj +1 more source