Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...

Eggshell quality is one of the most common problems in layer stocks. Results from the field have shown that the incidence of cracked eggs in layer stocks ranges from 1-2% to 30-35% (ALTAN and ALTAN, 1992). This problem is more specific in older flocks when the birds were raised under high environmental temperatures. The eggshell consists of 98% calcium carbonate. The necessary Ca for shell form...

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...

‎in this paper we give a characterization for all commutative‎ ‎rings with $1$ whose zero-divisor graphs are $c_4$-free.‎

Manipulation of membrane dynamics Nihal Altan-Bonnet (National Institutes of Health) described positive-sense RNA enteroviruses that manipulate the host to generate phosphatidylinositol 4-phosphate (PI4P) and cholesterol-rich membrane platforms for efficient viral replication. The enzyme PI4KIIIβ is hijacked by the enteroviral protein 3A to generate new pools of PI4P at these membrane platforms...

Over the years, we have seen how, thanks to experimentation on animal models, foundations been laid in field of implantology. In most cases, studies related bone scale are carried out species that similar their movements and behavior humans. The femur has selected as reference for our test, selecting animals experiment with goat breed, bovine breed porcine similarity human body, obtaining speci...

a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...

0

in this paper we study the coprime graph of a group $g$. the coprime graph of a group $g$, is a graph whose vertices are elements of $g$ and two distinct vertices $x$ and $y$ are adjacent iff $(|x|,|y|)=1$. in this paper we classify all the groups which the coprime graph is a complete r-partite graph or a planar graph. also we study the automorphism group of the coprime graph.

A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.