On the bandwidth of caterpillars with hairs of length 1 and 2
The Bandwidth problem for a graph seeks to find a labeling for the vertices of a graph G with nonnegative integers such that the maximum difference between any pair of vertices is minimized. In this study, an algorithm for finding the a labeling of caterpillars with hairs of length 1 and 2 will be p...
Saved in:
Main Authors: | Arguillo, Ryan, De Leon, Leah Lu Lina |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2002
|
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/17199 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
Existence of independent [1, 2]-sets in caterpillars
by: Santoso, Eko Budi, et al.
Published: (2016)
by: Santoso, Eko Budi, et al.
Published: (2016)
Similar Items
-
Existence of independent [1, 2]-sets in caterpillars
by: Santoso, Eko Budi, et al.
Published: (2016) -
Existence of independent [1, 2]-sets in caterpillars
by: Santoso, Eko Budi, et al.
Published: (2016) -
Caterpillars and butterflies
by: Manalastas, Pia Redempta T.
Published: (2021) -
On the Rainbow Mean Indexes of Caterpillars
by: Garciano, Agnes, et al.
Published: (2023) -
Motion planning and simulation of a caterpillar robot
by: Seethapathy Janarthanan.
Published: (2008)