On seed graphs with more than two components

Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On seed graphs with more than two components
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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

Similar results(10)