On (3,1)－Total Labeling of Cactus Graphs
碩士 === 中原大學 === 應用數學研究所 === 101 === Let G be a graph. A (p,1)-total labeling of G is an assignment of integers to each vertex and edge of G such that any adjacent vertices of G are labeled with distinct integers, any adjacent edges of G are labeled with distinct integers and a vertex and its inciden...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/50223527820819840435 |