We study Sowa’s conceptual graphs (CGs) with both existential and universal quantifiers. We explore in detail the existential fragment. We extend and modify Sowa’s original graph derivation system with new rules and prove the soundness and completeness theorem with respect to Sowa’s standard interpretation of CGs into first order logic (FOL). The proof is obtained by reducing the graph derivati...

In a proper edge-coloring of cubic graph, an edge e is normal if the set colors used by five edges incident with end has cardinality 3 or 5. The Petersen coloring conjecture asserts that every bridgeless graph 5-edge-coloring, is, 5-edge-coloring such all are normal. this paper, we prove result related to conjecture. parameter μ3 measurement for graphs, introduced Steffen in 2015. Our shows G a...

the fact that the properties of a molecule are tightly connected to its structural  characteristics  is one of the fundamental concepts in chemistry. in this connection,  graph theory has been successfully applied in developing some relationships between topological indices and some thermodynamic properties. so ,  a novel method for computing the new descriptors to construct a quantitative rela...

abstract background: a major problem of the first moments of childbirth, especially in “prolonged labor,” is perinatal asphyxia which necessitates neonatal resuscitation. this study aimed at evaluating the alert line of the partogram in recognizing the need for neonatal resuscitation 20–30 s after delivery. materials and methods: 140 full‑term pregnant women were kept under surveillance through...

Term graph rewriting is concerned with the representation of functional expressions as graphs, and the evaluation of these expressions by rule-based graph transformation. Representing expressions as graphs allows to share common subexpressions, improving the eeciency of term rewriting in space and time. Besides eeciency, term graph rewriting diiers from term rewriting in properties like termina...

0

the annihilating-ideal graph of a commutative ring $r$ is denoted by $ag(r)$, whose vertices are all nonzero ideals of $r$ with nonzero annihilators and two distinct vertices $i$ and $j$ are adjacent if and only if $ij=0$. in this article, we completely characterize rings $r$ when $gr(ag(r))neq 3$.

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.

One can associate to a bipartite graph so-called edge ring whose spectrum is an affine normal toric variety. We characterize the faces of (edge) cone associated this variety in terms some independent sets graph. By applying characterization combinatorial study deformations varieties by Altmann, we present certain criteria for their rigidity purely graphs.