EuDML | Browse

By a ternary system we mean an ordered pair $(W, R)$ , where $W$ is a finite nonempty set and $R \subseteq W \times W \times W$ . By a signpost system we mean a ternary system $(W, R)$ satisfying the following conditions for all $x, y, z \in W$ : if $(x, y, z) \in R$ , then $(y, x, x) \in R$ and $(y, x, z) \notin R$ ; if $x \neq y$ , then there exists $t \in W$ such that $(x, t, y) \in R$ . In this paper, a signpost system is used as a common description of a connected graph and a spanning tree of the graph. By a ct-pair we mean an ordered pair $(G, T)$ , where $G$ is a connected graph and $T$ is a spanning tree of $G$ . If $(G, T)$ is a ct-pair, then by the guide to...

Sobre un cono convexo asociado a un grafo.

Juan García Laguna (1984)

Trabajos de Estadística e Investigación Operativa

En este artículo se construye un cono convexo sobre un grafo y se estudian las propiedades básicas de este cono convexo: dimensión, linealidad y sistemas minimales de generadores. El interés de esta situación tiene su origen en problemas de decisión, donde la información disponible está dada por órdenes parciales entre las componentes de la información. Sin embargo, el estudio realizado es independiente de los problemas de decisión que lo motivan.

Sofic Systems and Graphs.

Roland Fischer (1975)

Monatshefte für Mathematik

Some applications of graph theory in the theory of hypergraphs

J. Nieminen (1975)

Applicationes Mathematicae

Some classes of perfect strongly annihilating-ideal graphs associated with commutative rings

Mitra Jalali, Abolfazl Tehranian, Reza Nikandish, Hamid Rasouli (2020)

Commentationes Mathematicae Universitatis Carolinae

Let $R$ be a commutative ring with identity and $A (R)$ be the set of ideals with nonzero annihilator. The strongly annihilating-ideal graph of $R$ is defined as the graph $SAG (R)$ with the vertex set $A {(R)}^{*} = A (R) ∖ {0}$ and two distinct vertices $I$ and $J$ are adjacent if and only if $I \cap Ann (J) \neq (0)$ and $J \cap Ann (I) \neq (0)$ . In this paper, the perfectness of $SAG (R)$ for some classes of rings $R$ is investigated.

Currently displaying 1 – 20 of 43

Page 1 Next

Displaying 1 – 20 of 43

Seidel-Equivalence in LB3 (6) Graphs.

Self-complementary vertex-transitive undirected graphs

Self-derived polar graphs

Semidomatic numbers of directed graphs

Sequences of dominating sets.

Series-parallel graphs and well- and better-quasi-orderings

Shields-Harary numbers of graphs with respect to continuous concave cost functions.

Signpost systems and spanning trees of graphs

Sobre un cono convexo asociado a un grafo.

Sofic Systems and Graphs.

Some applications of graph theory in the theory of hypergraphs

Some classes of perfect strongly annihilating-ideal graphs associated with commutative rings

Some families of $S$ -graphs.

Some general classes of comatching graphs.

Some Heuristics in Automatic Theorem Proving

Some heuristics in automatic theorem proving.

Some properties of locally homogeneous graphs.

Some Relations for Graphic Polynomials

Some remarks on Menger's theorem

Some remarks on the complement of a line graph

Currently displaying 1 – 20 of 43