Abstract: Let G=(V,E) be a graph and let f:V(G)→{0,1,2} be a function‎. ‎A vertex v is protected with respect to f‎, ‎if f(v)>0 or f(v)=0 and v is adjacent to a vertex of positive weight‎. ‎The function f is a co-Roman dominating function‎, ‎abbreviated CRDF if‎: ‎(i) every vertex in V is protected‎, ‎and (ii) each u∈V with positive weight has a neighbor v∈V with f(v)=0 such that the func...

In this paper we investigate the stability of one-sided perturbation to g-frame expansions. We show that if $Lambda$ is a g-frame of a Hilbert space $mathcal{H}$, $Lambda_{i}^{a}=Lambda_{i}+Theta_{i}$ where $Theta_{i} in mathcal{L}(mathcal{H},mathcal{H}_{i})$, and $widetilde{f}=sum_{i in J}Lambda_{i}^{star}widetilde{Lambda}_{i}^{a}f$, $widehat{f}=sum_{i in J}(Lambda_{i}^{a})^{star}widetilde{Lam...

We obtain inequalities involving many topological indices in classical graph products by using the f-polynomial. In particular, we work with lexicographic product, Cartesian sum and first Zagreb, forgotten, inverse degree lordeg indices.

let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

Background and Objectives: Furfural (F) and hydroxymethyl furfural (HMF) are cyclic aldehydes, which are formed during the heat processing of foods. These chemical contaminants have received much attention due to their suspected health hazards and heat damage indicators. The aim of the present study was extraction and determination of F and HMF in baby-foods using dispersive liquid-liquid micro...

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

a graph g = (v,e) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : v (g) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ v (g), xy ∈ e(g), and the total number of 0, 1 and 2 are balanced. that is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). in thi...

A total weighting of a graph G is a mapping f which assigns to each element z ∈ V (G)∪E(G) a real number f(z) as its weight. The vertex sum of v with respect to f is φf (v) = ∑ e∈E(v) f(e) + f(v). A total weighting is proper if φf (u) 6= φf (v) for any edge uv of G. A (k, k′)-list assignment is a mapping L which assigns to each vertex v a set L(v) of k permissible weights, and assigns to each e...

a 1993 result of j. llibre, and m. misiurewicz, (theorem a [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. also a 1980 result of l.s. block, j. guckenheimer, m. misiurewicz and l.s. young (lemma 1.5 [3]) states that if g is an a-graph of f then h(g) ? h( f ). in this pap...