Friendly Index Research Articles

Effective and selective Type V deep eutectic solvent based microextraction of E127 in foodstuffs and drugs

The effective and selective deep eutectic solvent (DES) based microextraction method was developed for the first time, using new generation Type V DES for the separation and determination of E127 (erythrosine) in foodstuffs and drugs. Dicyclohexylamine and diphenylamine were mixed at 1:5 mol ratio to create the DES. The essential parameters (pH, DES volume and vortex time) were optimized using Box-Behnken Design of Response Surface Methodology. The quadratic microextraction approach was favorable chemometric model design (R2=0.9945) for the method. The limits of detection and quantitation were determined to be 23 and 78 µg/L, respectively. E127 was enriched to be thirty-fold at the optimum conditions. The concentrations of E127, ranging between 0.078 and 4.0 µg/mL, were linearly determined using the equation A=62.114 C+3.8 (R2=0.9989). The interference effect of ions and dyes was investigated in detail. The relative standard deviation was lower than 6 % throughout the experiments. Analyte addition-recovery tests were applied to the real samples for determination of their E127 concentrations. The method was validated by calculating microextraction recoveries obtained from spiked tests. E127 contents of foodstuffs and drugs were determined between 8.8 and 42.4 µg/g, with recovery values ranging from 94 % to 102 %. AGREEmethod and AGREEprep tools were used to define environmentally friendly index of the method.

Selective and invisible separation and determination of Rhodamine B in diverse industrial samples using aqueous biphasic switchable hydrophilicity solvent-like based microextraction method

An effective and selective aqueous biphasic switchable hydrophilicity solvent-like based microextraction method (ABSHS-ME) combined with UV–vis spectrophotometry was established for the first time to monitor Rhodamine B (RhB) at 550 nm in soaps, lipsticks, anti-freezes and match tips. RhB was extracted firstly as its invisible form into immiscible hydrophobic phase and then converted to its UV–vis active form using acidified ethanol. The essential extraction parameters (pH, SHS volume, and vortex time) were optimized by Box-Behnken Design of Response Surface Methodology. Quadratic model with R2 = 0.9893 was found as favourable chemometric design for ABSHS-ME method. Preconcentration factor was obtained to be 25. Effect of matrix ions and dyes were examined in detail. 7 and 24 µg/L of Rhb were determined for limit of detection and limit of quantitation, respectively. RhB was determined linearly between 24 and 2500 µg/L. Relative standard deviations were lower than 7 %. ABSHS-ME method was validated determining the RhB concentrations of industrial samples with analyte addition-recovery tests. RhB contents of the real samples analyzed were found between 0.26–1.07 µg/g and 1.53–4.73 µg/mL with recovery values ranging from 95 to 101 %. The environmentally friendly index of the method was evaluated using the new generation AGREE tool.

The Full m Index Sets of P2×Pn

Shiu and Kwong (2008) studied the full friendly index set of P2×Pn, which only addressed the cases where m=0 or 1. In this paper, we significantly extend their work by determining the full m index set MP2×Pn for all values of m. Our key approach is to utilize graph embedding and recursion methods to deduce MP2×Pn for general m. In particular, we embed small graphs like C4 and K2 into P2×Pn and apply recursive techniques to prove the main results. This work expands the scope of previous graph labeling studies and provides new insights into determining the full m index set of product graphs. Given the broad range of applications for labeled graphs, this research can potentially impact fields like coding theory, communication network design, and more.

3-Vertex friendly index sets of operations of two graphs

The process of assigning integer values either to vertices or edges of a graph is known as graph labeling. A mapping f:VG→{0,1,2} is called ternary vertex labeling and fv represents the vertex label for v. The set FI3vG={ef∗i-ef∗j:f∗ runs over all 3-vertex friendly labeling f for all i,j∈{0,1,2}} is referred as 3-vertex friendly index set. In order to achieve FI3vG, number of vertices are partitioned into V0,V1,V2 such that Vi-Vj≤1for alli,j=0,1,2 with i≠j and label the edge uv by |f(u)-f(v)|wheref(u),f(v)∈{0,1,2}. A study of 3-vertex friendly index sets of operations of two graphs such as union, join and cartesian product are presented in this paper.

Full friendly index sets of mCn

Full friendly index sets of mCn

Nurturing care indicators for the Brazilian Early Childhood Friendly Municipal Index (IMAPI).

The Nurturing Care Framework (NCF) calls for establishing a global monitoring and accountability systems for early childhood development (ECD). Major gaps to build low‐cost and large‐scale ECD monitoring systems at the local level remain. In this manuscript, we describe the process of selecting nurturing care indicators at the municipal level from existing routine information systems to develop the Brazilian Early Childhood Friendly Index (IMAPI). Three methodological steps developed through a participatory decision‐making process were followed. First, a literature review identified potential indicators to translate the NCF domains. Four technical panels composed of stakeholders from federal, state and municipal levels were consulted to identify data sources, their availability at the municipal level and the strengths and weakness of each potential indicator. Second, national and international ECD experts participated in two surveys to score, following a SMART approach, the expected performance of each nurturing care indicator. This information was used to develop analytical weights for each indicator. Third, informed by strengths and weaknesses pointed out in the previous steps, the IMAPI team reached consensus on 31 nurturing care indicators across the five NCF domains (Good health [n = 14], Adequate nutrition [4], Responsive caregiving [1], Opportunities for early learning [7] and Security and safety [4]). IMAPI represents the first attempt to select nurturing care indicators at the municipal level using data from existing routine information systems.

Full-edge friendly index sets of fan

Let G be a graph with vertex set V(G) and edge set E(G), the labeling function of the edge f+ : E(G) → {0, 1} is induced by the labeling function of the point f : V(G) → {0, 1}, where v f (i) and e f (i) denotes the number of vertices and edges labeled i. A vertex labeling f of a graph G is said to be friendly if | v f (1) − v f (0) |≤ 1. This article discusses the value range of v f (0) value in the case of n being odd and even. The full edge friendly index sets of Fan is given by using the decomposition of graph structure and the method of point labeling interchange.

3-Vertex Friendly Index Set of Graphs

Graph labeling is an assignment of integers to the vertices or the edges, or both, subject to certain conditions. In literature we find several labelings such as graceful, harmonious, binary, friendly, cordial, ternary and many more. A friendly labeling is a binary mapping such that where and represents number of vertices labeled by 1 and 0 respectively. For each edge assign the label , then the function f is cordial labeling of G if and , where and are the number of edges labeled 1 and 0 respectively. A friendly index set of a graph is { runs over all f riendly labeling f of G} and it is denoted by FI(G). A mapping is called ternary vertex labeling and represents the vertex label for . In this article, we extend the concept of ternary vertex labeling to 3-vertex friendly labeling and define 3-vertex friendly index set of graphs. The set runs over all 3 ? vertex f riendly labeling f f or all is referred as 3-vertex friendly index set. In order to achieve , number of vertices are partitioned into such that for all with and la- bel the edge by where . In this paper, we study the 3-vertex friendly index sets of some standard graphs such as complete graph Kn, path Pn, wheel graph Wn, complete bipartite graph Km,n and cycle with parallel chords PCn.

Early Childhood Development Friendly Index (IMAPI): Assessing the Enabling Environment for Nurturing Care in Brazilian Municipalities

Abstract Objectives Early inequities in Early Childhood Development (ECD) are linked to inequalities across the five regions and within the 5570 municipalities in Brazil. We aimed to operationalize an index (IMAPI) to assess and monitor the enabling environment for nurturing care at the regional and municipal level in Brazil using existing national databases. Methods We followed three steps to operationalize IMAPI. I) Selection of indicators. The literature review guided the identification of existing indicators to translate each domain of the Nurturing Care Framework (Good Health, Adequate Nutrition, Opportunities for Early Learning, Responsive Caregiving, and Safety and Protection). Subsequently, meetings with experts and key Brazilian stakeholders informed the identification and selection of existing data in the national databases. II) Consultation with experts. Weights for the selected indicators were defined through a process based on the SMART approach. III) Analyzing IMAPI. Statistical and machine learning methods were used to compute an overall IMAPI as well as an index for each nurturing care domain that ranges from 0 (lowest score) to 100 (highest score). Means were calculated for each region of Brazil-based on municipalities indexes. Results IMAPI summarizes a set of 29 indicators: good health (14 indicators), adequate nutrition (4), early learning (7), responsive caregiving (0), and security and safety (4). Adequate nutrition domain presented the lowest median indexes (ranging from 32 to 22) and it was one of the most challenging to get reliable indicators due to the low coverage of national nutritional databases. The biggest difference means (DM) between regions with the best and worst indexes were found for early learning (DM = 17, ranging), good health (DM = 15) and security and safety (DM = 11), respectively. Responsive caregiving indicators were not identified at the municipal level within the existing national databases. A final version of IMAPI for each of the 5570 Brazilian municipalities incorporating sensitive analysis is being tested. Conclusions IMAPI discriminates regional and municipal enabling and constraining environments to promote ECD in Brazil which can facilitate informed policy decisions to address early inequities. Funding Sources Bill and Melinda Gates Foundation, CNPq, FAPDF.

Safe Haven and Performance of Extension-Markowitz Portfolio on Indonesian Ethical Investments

There has been ongoing discussion about the performance of ethical investments. Unlike previous studies, this research used extension Markowitz model to measure the market-based performance of ethical investments in Indonesia. In addition, this research also investigated whether gold was the safe haven instrument for the extension-Markowitz portfolio in Indonesia when the equity market was in extreme turmoil. The stocks from environmentally friendly firms (SRI) and Jakarta Islamic Index (JII) in Indonesia were used as the proxies of ethical investments. The results showed that the extension of Markowitz model could create an optimum portfolio that outperformed the market index. The result of this study supported the social impact hypothesis implying that environmental and social spending could improve stock market performance. Also, based on quantile regression (QREG) and ordinary least squares (OLS), this study found that gold was the safe haven and hedging instrument for ethical investors in Indonesia.

On friendly index sets of k-galaxies

Let G = ( V , E ) be a graph. A vertex labeling f : V → Z 2 induces an edge labeling f * : E → Z 2 defined by f * ( x y ) = f ( x ) + f ( y ) , for each edge x y ∈ E . For i ∈ Z 2 , let v f ( i ) = ∣{ v ∈ V : f ( v ) = i }∣ and e f ( i ) = ∣{ e ∈ E : f * ( e ) = i }∣ . We say that f is f r i e n d l y if ∣ v f (1) − v f (0)∣ ≤ 1 . The friendly index set of G , denoted by FI ( G ) , is defined as FI( G ) = ∣ e f (1) − e f (0)∣ : vertex labeling f is friendly . A k -galaxy is a disjoint union of k stars. In this paper, we establish the friendly index sets for various classes of k -galaxies.

On friendly index set of graphs

On friendly index set of graphs

Carbon dioxide emission and bio-capacity indexing for transportation activities: A methodological development in determining the sustainability of vehicular transportation systems

CO2 emissions from urban traffic are a major concern in an era of increasing ecological disequilibrium. Adding to the problem net CO2 emissions in urban settings are worsened due to the decline of bio-productive areas in many cities. This decline exacerbates the lack of capacity to sequestrate CO2 at the micro and meso-scales resulting in increased temperatures and decreased air quality within city boundaries. Various transportation and environmental strategies have been implemented to address traffic related CO2 emissions, however current literature identifies difficulties in pinpointing these critical areas of maximal net emissions in urban transport networks. This study attempts to close this gap in the literature by creating a new lay-person friendly index that combines CO2 emissions from vehicles and the bio-capacity of specific traffic zones to identify these areas at the meso-scale within four ranges of values with the lowest index values representing the highest net CO2 levels. The study used traffic volume, fuel types, and vehicular travel distance to estimate CO2 emissions at major links in Dhaka, Bangladesh's capital city's transportation network. Additionally, using remote-sensing tools, adjacent bio-productive areas were identified and their bio-capacity for CO2 sequestration estimated. The bio-productive areas were correlated with each traffic zone under study resulting in an Emission Bio-Capacity index (EBI) value estimate for each traffic node. Among the ten studied nodes in Dhaka City, nine had very low EBI values, correlating to very high CO2 emissions and low bio-capacity. As a result, the study considered these areas unsustainable as traffic nodes going forward. Key reasons for unsustainability included increasing use of motorized traffic, absence of optimized signal systems, inadequate public transit options, disincentives for fuel free transport (FFT), and a decline in bio-productive areas.

On friendly index and product-cordial index sets of Möbius-liked graph

Let G be a simple graph with vertex set V(G) and edge set E(G). Let ⟨ℤ2, +,*⟩ be a field with two elements. A vertex labeling f : V(G) → ℤ2 induces two edge labelings f+: E(G) → ℤ2 such that f+ (xy) = f(x) + f(y), whereas f* : E(G) → ℤ2 such that f* (xy) = f(x) f(y), for each edge xy ∈ E(G). For i ϵ ℤ2, let and . A labeling f of a graph G is said to be friendly if |υf (0) −υf (1)|≤ 1. The friendly index set of the graph G, denoted FI(G), is defined as the vertex labeling f is friendly}. This is a generalization of graph cordiality. The corresponding multiplicative version is called the product-cordial index set, denoted PCI(G), defined as the vertex labeling f is friendly}. In this paper, we investigate the friendly index and product-cordial index sets of a family of cubic graphs known as Möbius-liked graph, MG(n) for even n ≥ 4.

Becoming Breastfeeding Friendly Index: Development and application for scaling-up breastfeeding programmes globally.

Global efforts to further improve exclusive breastfeeding rates have not been successful, in part because effective scaling-up frameworks and roadmaps have not been developed. The Becoming Breastfeeding Friendly (BBF) toolbox includes an evidence-based index, the BBF Index (BBFI), to guide the development and tracking of large scale, well-coordinated, multisector national breastfeeding promotion programmes. This paper describes the development of the BBFI, which is grounded in the Breastfeeding Gear Model complex adaptive systems framework. The BBFI was developed by the BBF Steering Committee in collaboration with a high-level Technical Advisory Group following the Delphi consensus methodology. Key benchmarks and definitions were informed by evidence-based health, nutrition, and newborn survival initiatives identified from the academic and grey literature. The BBFI consists of 8 gears (54 benchmarks): Advocacy (4); Political Will (3); Legislation and Policies (10); Funding and Resources (4); Training and Program Delivery (17); Promotion (3); Research and Evaluation (10); and Coordination, Goals, and Monitoring (3). Scores are generated for 8 gear scores plus a total country score to gauge the scaling-up enabling environment. The BBFI provides an evidence-based index to assist countries in (a) assessing their readiness to scale up breastfeeding programmes and (b) tracking scaling-up progress.

Full friendly index sets of slender and flat cylinder graphs

‎Let $G=(V,E)$ be a connected simple graph‎. ‎A labeling $f:V to Z_2$ induces an edge labeling‎ ‎$f^*:E to Z_2$ defined by $f^*(xy)=f(x)+f(y)$ for each $xy in E$‎. ‎For $i in Z_2$‎, ‎let‎ ‎$v_f(i)=|f^{-1}(i)|$ and $e_f(i)=|f^{*-1}(i)|$‎. ‎A labeling $f$ is called friendly if‎ ‎$|v_f(1)-v_f(0)|le 1$‎. ‎The full friendly index set of $G$ consists all possible differences‎ ‎between the number of edges labeled by 1 and the number of edges labeled by 0‎. ‎In recent years‎, ‎full friendly index sets for certain graphs were studied‎, ‎such as tori‎, ‎grids $P_2times P_n$‎, ‎and cylinders $C_mtimes P_n$ for some $n$ and $m$‎. ‎In this paper we study the full friendly‎ ‎index sets of cylinder graphs $C_mtimes P_2$ for $mgeq 3$‎, ‎$C_mtimes P_3$ for $mgeq 4$‎ ‎and $C_3times P_n$ for $ngeq 4$‎. ‎The results in this paper complement the existing results‎ ‎in literature‎, ‎so the full friendly index set of cylinder graphs are completely determined‎.

On friendly index sets of the edge-gluing of complete graph and cycles

Let G be a graph with vertex set V(G) and edge set E(G). A vertex labeling f:V(G)→Z2 induces an edge labeling f+:E(G)→Z2 defined by f+(xy)=f(x)+f(y), for each edge xy∈E(G). For i∈Z2, let vf(i)=|{v∈V(G):f(v)=i}| and ef(i)=|{e∈E(G):f+(e)=i}|. We say f is friendly if |vf(0)−vf(1)|≤1. We say G is cordial if |ef(1)−ef(0)|≤1 for a friendly labeling f. The set FI(G)={|ef(1)−ef(0)|:f is friendly} is called the friendly index set of G. In this paper, we investigate the friendly index sets of the edge-gluing of a complete graph Kn and n copies of cycles C3. The cordiality of the graphs is also determined.

On full friendly index sets of 1-level and 2-levels N-grids

Let G be a graph with vertex set V(G) and edge set E(G). A labeling f:V(G)→Z2 induces an edge labeling f∗:E(G)→Z2 defined by f∗(xy)=f(x)+f(y), for each edge xy∈E(G). For i∈Z2, let vf(i)=|{v∈V(G):f(v)=i}| and ef∗(i)=|{e∈E(G):f∗(e)=i}|. A labeling f of a graph G is said to be friendly if |vf(1)−vf(0)|≤1. The full friendly index set of a graph G, denoted FFI(G), is defined as {ef∗(1)−ef∗(0): the vertex labeling f is friendly}. We investigate the full friendly index sets of 1-level and 2-levels N-grids.

A New Approach in Finding Full Friendly Indices

Let G be a graph with vertex set V(G) and edge set E(G), a vertex labeling $$f : V(G)\rightarrow \mathbb {Z}_2$$ induces an edge labeling $$ f^{+} : E(G)\rightarrow \mathbb {Z}_2$$ defined by $$f^{+}(xy) = f(x) + f(y)$$ , for each edge $$ xy\in E(G)$$ . For each $$i \in \mathbb {Z}_2$$ , let $$ v_{f}(i)=|\{u \in V(G) : f(u) = i\}|$$ and $$e_{f^+}(i)=|\{xy\in E(G) : f^{+}(xy) = i\}|$$ . A vertex labeling f of a graph G is said to be friendly if $$| v_{f}(1)-v_{f}(0) | \le 1$$ . The friendly index set of the graph G, denoted by FI(G), is defined as $$\{|e_{f^+}(1) - e_{f^+}(0)|$$ : the vertex labeling f is friendly $$\}$$ . The full friendly index set of the graph G, denoted by FFI(G), is defined as $$\{e_{f^+}(1) - e_{f^+}(0)$$ : the vertex labeling f is friendly $$\}$$ . In this paper, we determine FFI(G) for a class of cubic graphs with full vertices blow-up of cycle by a complete tripartite graph K(1, 1, 2) using a new method known as embedding labeling graph method. As a by-product, we also discuss the cordiality and the full product-cordial index sets for this graph.

Full friendly index set — I

Let G=(V,E) be a graph, a vertex labeling f:V→Z2 induces an edge labeling f∗:E→Z2 defined by f∗(xy)=f(x)+f(y) for each xy∈E. For each, i∈Z2 define vf(i)=|f−1(i)| and ef(i)=|f∗−1(i)|. We call f friendly if |vf(1)−vf(0)|≤1. The full friendly index set of G is the set of all possible values of ef(1)−ef(0), where f is friendly. In this paper, we study the full friendly index sets of some standard graphs such as the complete graph Kn, the cycle Cn, fans Fm and F2,m and the Cartesian product of P3 and Pn i.e. P3×Pn.