Filters








11 Hits in 3.5 sec

The achromatic indices of the regular complete multipartite graphs

Nam-Po Chiang, Hung-Lin Fu
1995 Discrete Mathematics  
In this paper, we study the achromatic indices of the regular complete multipartite graphs and obtain the following results: (1) A good upper bound for the achromatic index of the regular complete multipartite  ...  of regular complete multipartite graphs.  ...  Song-Tyang Liu for his help in checking some of the results by using computer and also to the referees for their helpful comments.  ... 
doi:10.1016/0012-365x(93)e0207-k fatcat:l3rlgmhhl5dxvaa52xz6v5bgqe

Page 37 of Mathematical Reviews Vol. , Issue 96a [page]

1996 Mathematical Reviews  
Summary: “In this paper, we study the achromatic indices of the regular complete multipartite graphs and obtain the following results: (1) A good upper bound for the achromatic index of the regular complete  ...  of the regular complete multipartite graphs.  ... 

On upper bounds for the pseudo-achromatic index

Nam-Po Chiang, Hung-Lin Fu
1997 Discrete Mathematics  
In this paper, we give another approach to the pseudo-achromatic index and the achromatic index of a graph and study upper bounds for them. We have obtained the following best possible upper bounds:  ...  Acknowledgements We would like to express our thanks to the referees for their helpful comments which have made this paper much more readable and valuable.  ...  Jamison [10] and Chiang and Fu [5] gave the best possible upper bounds for the achromatic indices of the complete graph and the regular complete multipartite graph, respectively.  ... 
doi:10.1016/s0012-365x(96)00286-5 fatcat:em7tlntcmfhehn3w7tdh4mnc4y

The Pseudoachromatic Number of a Graph

V. Yegnanarayanan
2000 Southeast Asian Bulletin of Mathematics  
This parameter is determined for graphs such as cycles, paths, wheels, certain complete multipartite graphs, and for other classes of graphs. Some open problems are raised.  ...  The pseudoachromatic number of a graph G is the maximum size of a vertex partition of G (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there  ...  [24] investigated the achromatic number of the line graph L(K n ) of the complete graph K n for small n (n ≤ 14). Problem 4. Characterize all those graphs G such that ψ(G) = ψ(G c ) = n.  ... 
doi:10.1007/s100120070034 fatcat:qsoodmnnjbdvninbz3ihvv2yqu

The Pseudoachromatic Number of a Graph

V. Yegnanarayanan
2000 Southeast Asian Bulletin of Mathematics  
This parameter is determined for graphs such as cycles, paths, wheels, certain complete multipartite graphs, and for other classes of graphs. Some open problems are raised.  ...  The pseudoachromatic number of a graph G is the maximum size of a vertex partition of G (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there  ...  [24] investigated the achromatic number of the line graph L(K n ) of the complete graph K n for small n (n ≤ 14). Problem 4. Characterize all those graphs G such that ψ(G) = ψ(G c ) = n.  ... 
doi:10.1007/s10012-000-0129-z fatcat:cuejh34a7ndyvalofubbosepqu

Master index of volumes 141–150

1996 Discrete Mathematics  
Fu, The achromatic indices of the regular complete multipartite graphs 141 (1995) Choudum, S.A. and K.  ...  Tan, Kings in multipartite tournaments 147 (1995) Koh, K.M. and B.P. Tan, The diameter of an orientation of a complete multipartite graph 149 (1996) Kojman, M., see M.  ... 
doi:10.1016/s0012-365x(00)80002-3 fatcat:k6hlk6smvjavhkh23t3lqbuj6m

Index

2000 Discrete Mathematics  
WozH niak, Packing two copies of a tree into its fourth power 213 (2000) 169}178 Kierstead, H.A., On the choosability of complete multipartite graphs with part size three (Note) 211 (2000) 255}259 Kierstead  ...  Toft, On the HajoH s number of graphs 213 (2000) 153}161 Guttmann, A.J., Indicators of solvability for lattice models 217 (2000) 167}189 Guu, C.J., The cFunction 213 (2000) 163}167 Ha"uszczak  ... 
doi:10.1016/s0012-365x(00)00198-9 fatcat:pvoli2nzdrc6fjmljo5e2gmmky

b-coloring of Kneser graphs

R. Balakrishnan, T. Kavaskar
2012 Discrete Applied Mathematics  
We also establish the b-continuity of some families of regular graphs which include the family of odd graphs.  ...  The largest positive integer k for which G has a b-coloring using k In this paper, we obtain an upper bound for the b-chromatic number of some families of Kneser graphs.  ...  Graphs for which χ (G) = b(G) are trivially b-continuous (for instance, complete multipartite graphs and the Petersen graph).  ... 
doi:10.1016/j.dam.2011.10.022 fatcat:2bdldquw2bbgtnpbpet24la75e

International Journal Of Mathematical Combinatorics, Volume 3, 2009 [article]

Mao, Linfan (Editor-in-Chief)
2009 Zenodo  
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising  ...  460 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandache multi-spaces, Smarandache geometries, mathematical combinatorics, non-euclidean  ...  Open Problems We present the following open problem for further research. Open Problem. For what values of m (except 3,5) the graph C m × P n is super mean graph.  ... 
doi:10.5281/zenodo.9109 fatcat:hanl3omh75hu5p4d2tfp5i5kke

Page 165 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
The Shields-Harary indices of vulnerability of a graph.  ...  Classes of line graphs with small cycle double covers. (English summary) 2002g:05148 — (with Rodriguez, Andres) The achromatic number of the union of paths.  ... 

Page 134 of Mathematical Reviews Vol. 28, Issue Index [page]

Mathematical Reviews  
(English summary) 96k:05057 — (with Fu, Hung-Lin) The achromatic indices of the regular complete multipartite graphs. (English summary) 96a:05056 . Choudum, S. A. (with Kayathri, K.)  ...  The structure of the centroid in a Ptolemaic graph. (English summary) 96f:05070 Nomura, Kazumasa A remark on Mulder’s conjecture about interval-regular graphs.  ...