On seed graphs with more than two components

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F01%3A00000930" target="_blank" >RIV/61989100:27240/01:00000930 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On seed graphs with more than two components

Popis výsledku v původním jazyce

The closed neighbourhood NG[x] of a vertex x in a graph G is the subgraph of G induced by x and all neighbours of x. The seed of a vertex xG is the subgraph of G induced by all vertices of GNG[x] and we denote it by SG(x). A graph F is a seed graph if there exists a graph G such that SG(x)F for each xG. In this paper seed graphs with more than two components are studied. It is shown that if all components are of equal order, size or regularity then they are all isomorphic to a complete graph. In the general case it is shown how the structure of any component Fi of a seed graph F depends on the structure of all components `smaller' than Fi in the sense of `smaller order', `smaller size' or `smaller degree' in the case of regular components.

Název v anglickém jazyce

On seed graphs with more than two components

Popis výsledku anglicky

The closed neighbourhood NG[x] of a vertex x in a graph G is the subgraph of G induced by x and all neighbours of x. The seed of a vertex xG is the subgraph of G induced by all vertices of GNG[x] and we denote it by SG(x). A graph F is a seed graph if there exists a graph G such that SG(x)F for each xG. In this paper seed graphs with more than two components are studied. It is shown that if all components are of equal order, size or regularity then they are all isomorphic to a complete graph. In the general case it is shown how the structure of any component Fi of a seed graph F depends on the structure of all components `smaller' than Fi in the sense of `smaller order', `smaller size' or `smaller degree' in the case of regular components.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2001

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Discrete Mathematics

ISSN

0012365X

e-ISSN

—

Svazek periodika

233

Číslo periodika v rámci svazku

1-3

Stát vydavatele periodika

BE - Belgické království

Počet stran výsledku

12

Strana od-do

115-126

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—