Bounding the total domination subdivision number of a graph in terms of its order

By Favaron Odile   Karami Hossein   Sheikholeslami Seyyed  

Journal of Combinatorial Optimization, Vol. 21, Iss. 2, 2011-02 ,pp. : 209-218

Springer Publishing Company

Access to resources Recommend Favorite

Vertex Distinguishing Equitable Total Chromatic Number of Join Graph

By Wang Zhi-wen  

Acta Mathematicae Applicatae Sinica, Vol. 23, Iss. 3, 2007-07 ,pp. : 433-438

Springer Publishing Company

Access to resources Recommend Favorite

On the Chromatic Number of the Square of the Kneser Graph K(2K+1, K)

By Kim Seog-Jin   Nakprasit Kittikorn  

Graphs and Combinatorics, Vol. 20, Iss. 1, 2004-03 ,pp. : 79-90

Springer Publishing Company

Access to resources Recommend Favorite

ON THE EDGE GEODETIC NUMBER OF A GRAPH

By ATICI M.  

International Journal of Computer Mathematics, Vol. 80, Iss. 7, 2003-07 ,pp. : 853-861

Taylor & Francis Ltd

Access to resources Recommend Favorite

The number of walks in a graph

By Dress A.   Gutman I.  

Applied Mathematics Letters, Vol. 16, Iss. 5, 2003-07 ,pp. : 797-801

Elsevier

Access to resources Recommend Favorite