QRコード

H-kernels by walks in H-colored digraphs and the color-class digraph

Let H be a digraph possibly with loops and D a finite digraph without loops whose arcs are colored with the vertices of H (D is an H-colored digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively. For an arc (z1,z2) of D we will denote by cD(z1,z2) its color. A directed...

詳細記述

保存先:
書誌詳細
主要な著者: Hortensia Galeana-Sánchez, Rocío Sánchez-López
フォーマット: Artigo
言語:Inglês
出版事項: Taylor & Francis Group 2016-08-01
シリーズ:AKCE International Journal of Graphs and Combinatorics
主題:
オンライン・アクセス:http://www.sciencedirect.com/science/article/pii/S0972860016300883
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!