CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishA connected simple graph G is called $k$--cohesive if for any pair of distinct vertices $u,v \in V(G)$, $d(u) + d(v) + d(u,v) \ge k$. A subgraph $H$ of a connected graph $G$ is non-separating if $G -V(H)$ is connected. Locke [MAA Monthly - 1998] conjectured that given a tree $T$ on $n$ vertices, $n \ge 3$, any $2n$--cohesive graph has a non-separating copy of $T$. Here we prove that given a tree $T$ on $n$ vertices and diameter at most 4, any $(2n + 2)$--cohesive graph has a non-separating copy of $T$.
http://hdl.handle.net/11563/8935| Titolo: | Nonseparating n-trees of diameter at most 4 in (2n+2)-cohesive graphs. |
| Autori interni: | ABREU, Marien |
| Data di pubblicazione: | 2002 |
| Rivista: | CONGRESSUS NUMERANTIUM |
| Abstract: | A connected simple graph G is called $k$--cohesive if for any pair of distinct vertices $u,v \in V(G)$, $d(u) + d(v) + d(u,v) \ge k$. A subgraph $H$ of a connected graph $G$ is non-separating if $G -V(H)$ is connected. Locke [MAA Monthly - 1998] conjectured that given a tree $T$ on $n$ vertices, $n \ge 3$, any $2n$--cohesive graph has a non-separating copy of $T$. Here we prove that given a tree $T$ on $n$ vertices and diameter at most 4, any $(2n + 2)$--cohesive graph has a non-separating copy of $T$. |
| Handle: | http://hdl.handle.net/11563/8935 |
| Appare nelle tipologie: | 1.1 Articolo su Rivista |
File in questo prodotto:
Copyright © 2017