Kernels in digraphs with colored vertices

In this paper, we introduce the concept of up-color kernel, which is a generalization of a kernel for vertex-colored digraphs. We give sufficient and necessary conditions for several families of digraphs to have an up-color kernel, as well as for certain products of digraphs.

Publication Details

Journal
ArXiv.org
Published
2025-03-23
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Kernels in digraphs with colored vertices

ArXiv.org
Graph Labeling and Dimension Problems
article

Kernels in digraphs with colored vertices

article en

Abstract

In this paper, we introduce the concept of up-color kernel, which is a generalization of a kernel for vertex-colored digraphs. We give sufficient and necessary conditions for several families of digraphs to have an up-color kernel, as well as for certain products of digraphs.

ArXiv.org
Openalex Percentile: Top 47%
Graph Labeling and Dimension Problems
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Kernels in digraphs with colored vertices · ArXiv.org (2025) | TGRS Research Map | TGRS