Glucose-based Biofuel Cells: Nanotechnology as a Vital Science in Biofuel Cells Performance

Nanotechnology has opened up new opportunities for the design of nanoscale electronic devices suitable for developing high-performance biofuel cells. Glucose-based biofuel cells as green energy sources can be a powerful tool in the service of small-scale power source technology as it provides a latent potential to supply power for various implantable medical electronic devices. By using physiologically produced glucose as a fuel, the living battery can recharge for continuous production of electricity. This review article presents how nanoscience, engineering and medicine are combined to assist in the development of renewable glucose-based biofuel cell systems. Here, we review recent advances and applications in both abiotic and enzymatic glucose biofuel cells with emphasis on their “implantable” and “implanted” types. Also the challenges facing the design and application of glucose-based biofuel cells to convert them to promising replacement candidates for non-rechargeable lithium-ion batteries are discussed. Nanotechnology could make glucose-based biofuel cells cheaper, lighter and more efficient and hence it can be a part of the solutions to these challenges

The global burden of cancer attributable to risk factors, 2010-19 : a systematic analysis for the Global Burden of Disease Study 2019

Background Understanding the magnitude of cancer burden attributable to potentially modifiable risk factors is crucial for development of effective prevention and mitigation strategies. We analysed results from the Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) 2019 to inform cancer control planning efforts globally. Methods The GBD 2019 comparative risk assessment framework was used to estimate cancer burden attributable to behavioural, environmental and occupational, and metabolic risk factors. A total of 82 risk-outcome pairs were included on the basis of the World Cancer Research Fund criteria. Estimated cancer deaths and disability-adjusted life-years (DALYs) in 2019 and change in these measures between 2010 and 2019 are presented. Findings Globally, in 2019, the risk factors included in this analysis accounted for 4.45 million (95% uncertainty interval 4.01-4.94) deaths and 105 million (95.0-116) DALYs for both sexes combined, representing 44.4% (41.3-48.4) of all cancer deaths and 42.0% (39.1-45.6) of all DALYs. There were 2.88 million (2.60-3.18) risk-attributable cancer deaths in males (50.6% [47.8-54.1] of all male cancer deaths) and 1.58 million (1.36-1.84) risk-attributable cancer deaths in females (36.3% [32.5-41.3] of all female cancer deaths). The leading risk factors at the most detailed level globally for risk-attributable cancer deaths and DALYs in 2019 for both sexes combined were smoking, followed by alcohol use and high BMI. Risk-attributable cancer burden varied by world region and Socio-demographic Index (SDI), with smoking, unsafe sex, and alcohol use being the three leading risk factors for risk-attributable cancer DALYs in low SDI locations in 2019, whereas DALYs in high SDI locations mirrored the top three global risk factor rankings. From 2010 to 2019, global risk-attributable cancer deaths increased by 20.4% (12.6-28.4) and DALYs by 16.8% (8.8-25.0), with the greatest percentage increase in metabolic risks (34.7% [27.9-42.8] and 33.3% [25.8-42.0]). Interpretation The leading risk factors contributing to global cancer burden in 2019 were behavioural, whereas metabolic risk factors saw the largest increases between 2010 and 2019. Reducing exposure to these modifiable risk factors would decrease cancer mortality and DALY rates worldwide, and policies should be tailored appropriately to local cancer risk factor burden. Copyright (C) 2022 The Author(s). Published by Elsevier Ltd. This is an Open Access article under the CC BY 4.0 license.Peer reviewe

Reformulated F-index of graph operations

The first general Zagreb index is defined as $M_1^\lambda(G)=\sum_{v\in V(G)}d_{G}(v)^\lambda$ where $\lambda\in \mathbb{R}-\{0,1\}$‎. ‎The case $\lambda=3$‎, ‎is called F-index‎. ‎Similarly‎, ‎reformulated first general Zagreb index is defined in terms of edge-drees as $EM_1^\lambda(G)=\sum_{e\in E(G)}d_{G}(e)^\lambda$ and the reformulated F-index is $RF(G)=\sum_{e\in E(G)}d_{G}(e)^3$‎. ‎In this paper‎, ‎we compute the reformulated F-index for some graph operations‎

Eternal m-Security Bondage Numbers in Graphs

An eternal m-secure set of a graph G = (V,E) is a set S0 ⊆ V that can defend against any sequence of single-vertex attacks by means of multiple guard shifts along the edges of G. The eternal m-security number σm(G) is the minimum cardinality of an eternal m-secure set in G. The eternal m-security bondage number bσm (G) of a graph G is the minimum cardinality of a set of edges of G whose removal from G increases the eternal m-security number of G. In this paper, we study properties of the eternal m-security bondage number. In particular, we present some upper bounds on the eternal m-security bondage number in terms of eternal m-security number and edge connectivity number, and we show that the eternal m-security bondage number of trees is at most 2 and we classify all trees attaining this bound

The Distance Roman Domination Numbers of Graphs

Let $k$ be a positive integer, and let $G$ be a simple graph with vertex set $V (G)$. A k-distance Roman dominating function on $G$ is a labeling $f : V (G) → {0, 1, 2}$ such that for every vertex with label 0, there is a vertex with label 2 at distance at most $k$ from each other. The weight of a $k$-distance Roman dominating function $f$ is the value $\omega (f) =∑_{v∈V} f(v)$. The k-distance Roman domination number of a graph $G$, denoted by $\gamma_R^k (D)$, equals the minimum weight of a $k$-distance Roman dominating function on G. Note that the 1-distance Roman domination number $\gamma_R^1 (G)$ is the usual Roman domination number $\gamma_R (G)$. In this paper, we investigate properties of the $k$-distance Roman domination number. In particular, we prove that for any connected graph $G$ of order $n \geq k +2$, $\gamma_R^k (G) \leq 4n//(2k +3)$ and we characterize all graphs that achieve this bound. Some of our results extend these ones given by Cockayne et al. in 2004 and Chambers et al. in 2009 for the Roman domination number

Eternal m-Security Bondage Numbers in Graphs

An eternal m-secure set of a graph $G = (V,E)$ is a set $S_0 \subseteq V$ that can defend against any sequence of single-vertex attacks by means of multiple guard shifts along the edges of $G$. The eternal m-security number $\sigma_m (G)$ is the minimum cardinality of an eternal m-secure set in $G$. The eternal m-security bondage number $b_{\sigma_m} (G)$ of a graph $G$ is the minimum cardinality of a set of edges of $G$ whose removal from $G$ increases the eternal m-security number of $G$. In this paper, we study properties of the eternal m-security bondage number. In particular, we present some upper bounds on the eternal m-security bondage number in terms of eternal m-security number and edge connectivity number, and we show that the eternal m-security bondage number of trees is at most 2 and we classify all trees attaining this bound