Graceful Labeling of some classes of Spider Graphs with Three legs greater than one

Tiang Poomsa-ard


A spider graph is a tree with at most one vertex of degree greater

than $2$. A graceful labeling of a tree $T$ with $n$ edges is a

bijection $f:V(T) \rightarrow \{0,1,2,\ldots,n\}$ such that

$\{|f(u)-f(v)|:\{u,v\}$ is an edge of $T \} = \{1,2,\ldots,n\}$.

We show that some classes of spider graphs admit graceful labeling.

Full Text: PDF


  • There are currently no refbacks.

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|