‎let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge‎ ‎set $e(g)$‎. ‎the (first) edge-hyper wiener index of the graph $g$ is defined as‎: ‎$$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$‎ ‎where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...

Abstract Epistemic virtues are character traits conducive to principled ways of thinking, leading a life flourishing. Recent years have witnessed an emergence theoretical accounts describing how they develop. However, few if any studies conducted rigorous empirical investigation into the mechanisms intellectual virtue development. In this study, we review several significant frameworks before u...

The increasing interest in unrefined flour-based products demands innovative strategies to improve dough properties and bread quality. This study investigated the effect of an empirical practice used by bakers – gradual flour addition during kneading on wholewheat After optimizing operating conditions perform kneading, a full factorial design tested optimized samples as function total water con...

this study was conducted to investigate the hair production and fleece characteristics of hairy goats according to the sex and age of animals. the material of the study consisted one total data of 73 hair goats, which were between more than one year-old and one year-old lori goats from both sexes (26 males and 47 females). the overall fleece weight, fiber length, lock length, washing yield, hai...

The quality of grains and flour can be influenced by genetics, crop management, environment. objective this study was to evaluate the technological wheat interaction among genotype, nitrogen (N) fertilization weather conditions in different regions adaptation southern Brazil, aiming support farmers bakery industry sector their decision-making processes. experiment carried out three environments...

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs can be computed in polynomial time.

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...