On the beta-number of linear forests with an even number of components
The beta-number of a graph G is the smallest positive integer n for which there exists an injective function f : V G → 0 , 1 , … , n such that each u v ∈ E G is labeled | f u − f v | and the resulting set of edge labels is c , c + 1 , … , c + | E G | − 1 for some positi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860017301792 |