SCOPUS 정보 검색 플랫폼

Volumn 309, Issue 10, 2009, Pages 3427-3430

The L (d, 1)-number of powers of paths

Author keywords

Distance two labelling; L (d, 1) labelling; Powers of paths

Indexed keywords

DISTANCE TWO LABELLING; GRAPH G; L (D, 1)-LABELLING; POSITIVE INTEGER D; POWERS OF PATHS;

LABELING;

EID: 67349107014 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/j.disc.2008.08.018 Document Type: Article

Times cited : (1)

References (10)

1
- 33750117332
- The L (h, k)-labelling problem: A survey and annotated bibliography
- Calamoneri T. The L (h, k)-labelling problem: A survey and annotated bibliography. Comput. J. 49 5 (2006) 585-608
- (2006) Comput. J. , vol.49 , Issue.5 , pp. 585-608
- Calamoneri, T.¹

2
- 33745676997
- Labeling trees with a condition at distance two
- Calamoneri T., Pelc A., and Petreschi R. Labeling trees with a condition at distance two. Discrete Math. 306 14 (2006) 1534-1539
- (2006) Discrete Math. , vol.306 , Issue.14 , pp. 1534-1539
- Calamoneri, T.¹ Pelc, A.² Petreschi, R.³

3
- 0012824969
- On L (d, 1)-labelings of graphs
- Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., and Yeh R.K. On L (d, 1)-labelings of graphs. Discrete Math. 220 (2000) 57-66
- (2000) Discrete Math. , vol.220 , pp. 57-66
- Chang, G.J.¹ Ke, W.-T.² Kuo, D.³ Liu, D.D.-F.⁴ Yeh, R.K.⁵

4
- 33646180600
- On the computational complexity of the L (2, 1)-labeling problem for regular graphs
- Fiala J., and Kratochvíl J. On the computational complexity of the L (2, 1)-labeling problem for regular graphs. Lecture Notes Comput. Sci. 3701 (2005) 228-236
- (2005) Lecture Notes Comput. Sci. , vol.3701 , pp. 228-236
- Fiala, J.¹ Kratochvíl, J.²

5
- 0037566612
- Generalized vertex labelings with a condition at distance two
- Georges J.P., and Mauro D.W. Generalized vertex labelings with a condition at distance two. Congressus Numer. 109 (1995) 141-159
- (1995) Congressus Numer. , vol.109 , pp. 141-159
- Georges, J.P.¹ Mauro, D.W.²

6
- 34247166461
- Real number graph labellings with distance conditions
- Griggs J.R., and Jin X.T. Real number graph labellings with distance conditions. SIAM J. Discrete Math. 20 2 (2006) 302-327
- (2006) SIAM J. Discrete Math. , vol.20 , Issue.2 , pp. 302-327
- Griggs, J.R.¹ Jin, X.T.²

7
- 0019213982
- Frequency assignment: Theory and applications
- Hale W.K. Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514
- (1980) Proc. IEEE , vol.68 , pp. 1497-1514
- Hale, W.K.¹

8
- 33750115492
- Bounds for the L (d, 1)-number of diameter 2 graphs, trees and cacti
- Kohl A. Bounds for the L (d, 1)-number of diameter 2 graphs, trees and cacti. Int. J. Mobile Netw. Des. Innovation 1 2 (2006) 124-135
- (2006) Int. J. Mobile Netw. Des. Innovation , vol.1 , Issue.2 , pp. 124-135
- Kohl, A.¹

9
- 67349198168
- Dissertation, TU Bergakademie Freiberg, Germany, in German
- A. Kohl, Knotenfärbungen mit Abstandsbedingungen, Dissertation, TU Bergakademie Freiberg, Germany, 2006 (in German)
- (2006) Knotenfärbungen mit Abstandsbedingungen
- Kohl, A.¹

10
- 32144442166
- The L (2, 1)-labelling of trees
- Wang W.-F. The L (2, 1)-labelling of trees. Discrete Appl. Math. 154 3 (2006) 598-603
- (2006) Discrete Appl. Math. , vol.154 , Issue.3 , pp. 598-603
- Wang, W.-F.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.