| dc.contributor.author | Fronček, Dalibor | |
| dc.date.accessioned | 2006-11-08T09:23:11Z | |
| dc.date.available | 2006-11-08T09:23:11Z | |
| dc.date.issued | 2001 | |
| dc.identifier.citation | Discrete Mathematics. 2001, vol. 233, issues 1-3, p. 115-126. | en |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.uri | http://hdl.handle.net/10084/57926 | |
| dc.language.iso | en | en |
| dc.publisher | North-Holland | en |
| dc.relation.ispartofseries | Discrete Mathematics | en |
| dc.relation.uri | https://doi.org/10.1016/S0012-365X(00)00231-4 | en |
| dc.subject | seed graphs | en |
| dc.subject | isomorphic survivor graphs | en |
| dc.subject | local properties of graphs | en |
| dc.title | On seed graphs with more than two components | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.description.abstract-en | 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 x E G is the subgraph of G induced by all vertices of G \ N-G[x] and we denote it by SG(X). A graph F is a seed graph if there exists a graph G such that S-G(x) congruent to F for each x is an element of G. 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 F-i 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. | en |
| dc.identifier.doi | 10.1016/S0012-365X(00)00231-4 | |
| dc.identifier.wos | 000168401100009 | |