Browsing by Author "Rojo, Oscar"
Now showing items 1-2 of 2
-
Rojo, Oscar; Medina, Luis; Abreu, Nair M. M. de; Justel, Claudia (2010-02)A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] ...
-
Rojo, Oscar (LINEAR ALGEBRA AND ITS APPLICATIONS, Volume: 428, Issue: 4, Pages: 754-764, 2008, 2008-02-01)G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the unique cycle of G. The graph G − E(Cr ) is a forest of r rooted treesT1,T2, . . .,Tr with root vertices v1, v2, . . ., ...