Notes: A note on collections of graphs with non-surjective lambda labelings

Authors:
John P. Georges;David W. Mauro
Affiliations:
Department of Mathematics, Trinity College, Hartford, CT 06013, USA;Department of Mathematics, Trinity College, Hartford, CT 06013, USA
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 12
Cited 1

Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition

SIAM Journal on Discrete Mathematics
Relating path coverings to vertex labellings with a condition at distance two

Discrete Mathematics
On the $\lambda$-Number of $Q_n$ and Related Graphs

SIAM Journal on Discrete Mathematics
On the size of graphs labeled with condition at distance two

Journal of Graph Theory
The $L(2,1)$-Labeling Problem on Graphs

SIAM Journal on Discrete Mathematics
On L(d, 1)-labelings of graphs

Discrete Mathematics
Labeling Products of Complete Graphs with a Condition at Distance Two

SIAM Journal on Discrete Mathematics
Labeling trees with a condition at distance two

Discrete Mathematics
No-hole L(2,1)-colorings

Discrete Applied Mathematics
On the Structure of Graphs with Non-Surjective L(2,1)-Labelings

SIAM Journal on Discrete Mathematics
Graph labeling and radio channel assignment

Journal of Graph Theory

Path covering number and L(2,1)-labeling number of graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

The @l-number of a graph G, denoted @l(G), is the smallest integer k such that there exists a function from V(G) into {0,1,2,...,k} under which adjacent vertices receive integers which differ by at least 2 and vertices at distance two receive integers which differ by at least 1. We establish the infinitude of the collection of connected graphs G with fixed maximum degree @D=4 and fixed @l-number @D+t, 1=