The study of the integrability properties of the N=2 Landau-Ginzburg models leads naturally to a graph generalization of the Yang-Baxter equation which synthetizes the well known vertex and RSOS Yang-Baxter equations.A non trivial solution of this equation is found for the t2 perturbation of the A-models, which turns out to be intimately related to the Boltzmann weights of a Chiral-Potts model....

We measured the emf of NaCl solutions (120-160 mmol/L) with a home-built cell in steady-state and with some commercial direct potentiometric analyzers about 20 s after the sample is introduced into the instrument. We compared the results with the theoretical sodium ion activity calculated according to different thermodynamic theories. The slope of the calibration graph was calculated with and w...

Reasoning with minimal models is at the heart of many knowledge representation systems. Yet, it turns out that this task is formidable even when very simple theories are considered. It is, therefore, crucial to be able to break this task into several subtasks that can be solved separately and in parallel. We show that minimal models of positive propositional theories can be decomposed based on ...

A noncommutative Feynman graph is a ribbon graph and can be drawn on a genus g 2-surface with a boundary. We formulate a general convergence theorem for the noncommutative Feynman graphs in topological terms and prove it for some classes of diagrams in the scalar field theories. We propose a noncommutative analog of Bogoliubov-Parasiuk’s recursive subtraction formula and show that the subtracte...

In this paper, approximations of acyclic graphs are studied. It is proved that any theory an graph (tree) finite diameter pseudofinite with respect to (trees), is, such approximated by theories structures (acyclic graphs, trees). also infinite number rays pseudofinite.

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

The project on knowledge graph theory was begun in 1982. At the initial stage, the goal was to use graphs to represent knowledge in the form of an expert system. By the end of the 80's expert systems in medical and social science were developed successfully using knowledge graph theory. In the following stage, the goal of the project was broadened to represent natural language by knowledge grap...