Cordial Labeling for Some Bistar Related Graphs

S K Vaidya, N H Shah

Abstract


In this paper we prove that square graph and shadow graph of bistar admit cordial labeling. Moreover we prove that splitting graph of bistar as well as degree splitting graph of bistar are cordial graphs.

Full Text:

PDF

References


M. Andar, S. Boxwala and N. B. Limaye, Cordial labelings of some wheel related

graphs, J. Combin. Math. Combin. Comput., 41(2002), 203-208.

M. Andar, S. Boxwala and N. B. Limaye, A note on cordial labeling of multiple

shells, Trends Math., (2002), 77-80.

J. B. Babujee and L. Shobana, Cordial Languages and Cordial Numbers, Journal

of Applied Computer Science & Mathematics, 13(6)(2012), 9-12.

I. Cahit, Cordial Graphs: A weaker version of graceful and harmonious Graphs,

Ars Combinatoria, 23 (1987), 201-207.

J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of

Combinatorics, 16, (2013), #DS6.

Available online: Available:http://www.combinatorics.org

R. L. Graham and N. J. A. Sloane, On additive bases and harmonious graphs,

SIAM J. Algebr. Disc. Meth., 1(4)(1980), 382-404.

J. Gross and J. Yellen, Graph Theory and its applications, CRC Press, (1999).

P. Lawrence Rozario Raj and S. Koilraj, Cordial labeling for the splitting graph

of some standard graphs, International Journal of Mathematics and Soft Com-

puting, 1(1) (2011), 105 - 114.

Y. S. Ho, S. M. Lee and S. C. Shee, Cordial labelings of unicyclic graphs and

generalized petersen graphs, Congr. Numer., 68 (1989), 109 - 122.

A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs,

International Symposium, Rome, July (1966), Gordon and Breach, New York

and Dunod Paris, (1967), 349 - 355.

P. Selvaraju, P. Balaganesan, J. Renuka and V. Balaj, Degree Splitting Graph

on Graceful, Felicitous and Elegant Labeling, International J. Math. Combin.,

(2012), 96-102.

S. K. Vaidya and N. A. Dani, Some new star related graphs and their cordial

as well as 3-equitable labeling, Journal of Sciences, 1(1)(2010), 111-114.

S. K. Vaidya and N. A. Dani, Cordial labeling and arbitrary super subdivision

of some graphs, International Journal of Information Science and Computer

Mathematics, 2 (1)(2010), 51 - 60.

S. K. Vaidya and N. H. Shah, 3-Equitable Labeling for Some Star and Bistar

Related Graphs, International Journal of Mathematics and Scientic Comput-

ing, 2(1)(2012), 3 - 8.

Available online: http://www.veltechuniv.edu.in/IJMSC/

S. K. Vaidya and N. H. Shah, Graceful and odd graceful labeling of some graphs,

International Journal of Mathematics and Soft Computing, 3(1)(2013), 61 - 68.

Available online: http://ijmsc.com/index.php/ijmsc

S. K. Vaidya and N. H. Shah, Some Star and Bistar Related Divisor Cordial

Graphs, Annals of Pure and Applied Mathematics, 3(1)(2013), 67-77.

Available online: www.researchmathsci.org

V. Yegnanaryanan and P. Vaidhyanathan, Some Interesting Applications of

Graph Labellings, J. Math. Comput. Sci., 2(5)(2012), 1522-1531.


Refbacks

  • There are currently no refbacks.




Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.