Note on seed graphs with components of given order

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F00%3A00012461" target="_blank" >RIV/61989100:27240/00:00012461 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Note on seed graphs with components of given order

Original language description

A graph "F" is a seed graph if there exists graph "G" with the property that after removal of any vertex and its neighbours the resulting subgraph is isomorphic to "F". In this paper seed graphs with more than two components are studied. It is shown thatif all components are of equal order, then they are all isomorphic to a complete graph. In the general case it is shown how the structure of any component of a seed graph "F" depends on the structure of all components of smaller order.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F98%2F1451" target="_blank" >GA201/98/1451: Special graph, hypergraph and algorithmic structures</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2000

Confidentiality

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

Name of the periodical

AMUC

ISSN

0862-9544

e-ISSN

—

Volume of the periodical

—

Issue of the periodical within the volume

1

Country of publishing house

SK - SLOVAKIA

Number of pages

7

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—