An algorithm determining (2-d)-kernels in trees

被引：0

作者：

Bednarz, Pawel ^{[1
]}

Wloch, Iwona ^{[1
]}

机构：

[1] Rzeszow Univ Technol, Fac Math & Appl Phys, Al Powstancow Warszawy 8, PL-35959 Rzeszow, Poland

来源：

UTILITAS MATHEMATICA | 2017年 / 102卷

关键词：

(2-d)-kernel; trees; graph algorithm AMS Subject Classification: 05C20; 05C69; INFINITE DIGRAPHS; EXISTENCE; KERNELS; GRAPHS; NUMBER;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper we give a complete characterization of trees with (2d)-kernel using special operations. Moreover we present an algorithm which determines (2-d)-kernel in trees.

引用

页码：215 / 222

页数：8

共 10 条

[1] [Anonymous], 2005, GRAPH THEORY
[2] Bednarz P, 2015, ARS COMBINATORIA, V121, P341
[3] Berge C., 1971, Principles of Combinatorics
[4] H-Kernels in Infinite Digraphs
Galeana-Sanchez, Hortensia
Sanchez-Lopez, Rocio
[J]. GRAPHS AND COMBINATORICS, 2013, 29 (04) : 913 - 920
[5] Some sufficient conditions for the existence of kernels in infinite digraphs
Galeana-Sanchez, Hortensia
Guevara, Mucuy-kak
[J]. DISCRETE MATHEMATICS, 2009, 309 (11) : 3680 - 3693
[6] ON THE COMPLEXITY OF THE 3-KERNEL PROBLEM IN SOME CLASSES OF DIGRAPHS
Hell, Pavol
Hernandez-Cruz, Cesar
[J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2014, 34 (01) : 167 - 185
[7] k-kernels in k-transitive and k-quasi-transitive digraphs
Hernandez-Cruz, Cesar
Galeana-Sanchez, Hortensia
[J]. DISCRETE MATHEMATICS, 2012, 312 (16) : 2522 - 2530
[8] Szumny Waldemar, 2007, Discussiones Mathematicae Graph Theory, V27, P457, DOI 10.7151/dmgt.1373
[9] On the existence and on the number of (k, l)-kernels in the lexicographic product of graphs
Szumny, Waldemar
Wloch, Iwona
Wloch, Andrzej
[J]. DISCRETE MATHEMATICS, 2008, 308 (20) : 4616 - 4624
[10] Wloch A, 2012, AUSTRALAS J COMB, V53, P273

← 1 →