TITLE

k-KERNELS IN GENERALIZATIONS OF TRANSITIVE DIGRAPHS

AUTHOR(S)
GALEANA-SÁNCHEZ, HORTENSIA; HERNÁNDEZ-CRUZ, CÉSAR
PUB. DATE
March 2011
SOURCE
Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p293
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
No abstract available.
ACCESSION #
60008983

 

Related Articles

  • KERNELS BY MONOCHROMATIC PATHS AND THE COLOR-CLASS DIGRAPH. GALEANA-SÁNCHEZ, HORTENSIA // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p273 

    No abstract available.

  • CYCLICALLY k-PARTITE DIGRAPHS AND k-KERNELS. GALEANA-SÁNCHEZ, HORTENSIA; HERNÁNDEZ-CRUZ, CÉSAR // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 1, p63 

    No abstract available.

  • ON THE EXISTENCE OF (k,l)-KERNELS IN INFINITE DIGRAPHS: A SURVEY. GALEANA-SÁNCHEZ, H.; HERNÁNDEZ-CRUZ, C. // Discussiones Mathematicae: Graph Theory;2014, Vol. 34 Issue 3, p431 

    Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N, u ≠ v, then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) - N then there exists v ∈ N such that d(u, v)...

  • 3-TRANSITIVE DIGRAPHS. Hernández-Cruz, César // Discussiones Mathematicae: Graph Theory;2012, Vol. 32 Issue 3, p205 

    Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is 3-transitive if the existence of the directed path (u; v;w; x) of length 3 in D implies the existence of the arc (u, x) ∈ A(D). In this article strong 3-transitive digraphs are...

  • $$\varPi $$ -Kernels in Digraphs. Galeana-Sánchez, Hortensia; Montellano-Ballesteros, Juan // Graphs & Combinatorics;Nov2015, Vol. 31 Issue 6, p2207 

    Let $$D=(V(D), A(D))$$ be a digraph, $$DP(D)$$ be the set of directed paths of $$D$$ and let $$\varPi $$ be a subset of $$DP(D)$$ . A subset $$S\subseteq V(D)$$ will be called $$\varPi $$ -independent if for any pair $$\{x, y\} \subseteq S$$ , there is no $$xy$$ -path nor $$yx$$ -path in...

  • MONOCHROMATIC CYCLES AND MONOCHROMATIC PATHS IN ARC-COLORED DIGRAPHS. GALEANA-SÁNCHEZ, HORTENSIA; GAYTÁN-GÓMEZ, GUADALUPE; ROJAS-MONROY, ROCÍO // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p283 

    No abstract available.

  • MONOCHROMATIC KERNEL-PERFECTNESS OF SPECIAL CLASSES OF DIGRAPHS. Galeana-Sánchez, Hortensia; Jiménez Ramírez, Luis Alberto // Discussiones Mathematicae: Graph Theory;2007, Vol. 27 Issue 3, p389 

    In this paper, we introduce the concept of monochromatic kernel-perfect digraph, and we prove the following two results: (1) If D is a digraph without monochromatic directed cycles, then D and each αν,ν ... V (D) are monochromatic kernel-perfect digraphs if and only if the composition...

  • A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F. Balbuena, Camino; Galeana-Sánchez, Hortensia; Guevara, Mucuy-kak // Acta Mathematica Sinica;Feb2012, Vol. 28 Issue 2, p349 

    A kernel of a directed graph is a set of vertices which is both independent and absorbent. And a digraph is said to be kernel perfect if and only if any induced subdigraph has a kernel. Given a set of arcs F, a semikernel S modulo F is an independent set such that if some Sz-arc is not in F,...

  • ON MONOCHROMATIC PATHS AND BICOLORED SUBDIGRAPHS IN ARC-COLORED TOURNAMENTS. DELGADO-ESCALANTE, PIETRA; GALEANA-SANCHEZ, HORTENSIA // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 4, p791 

    Consider an arc-colored digraph. A set of vertices N is a kernel by monochromatic paths if all pairs of distinct vertices of N have no monochromatic directed path between them and if for every vertex v not in N there exists n ∈ N such that there is a monochromatic directed path from v to n....

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics