IJPAM: Volume 117, No. 3 (2017)
AND BLOTTING NUMBER OF GRAPHS
Centre for Studies in Discrete Mathematics
Vidya Academy of Science and Technology
Thrissur, Kerala, INDIA
McPherson number denoted by , of a simple, undirected, finite, connected graph on vertices was introduced in 2015. The initial notion resulted in a grah which recursively evolved into a mixed complete graph. Hence, a graph having both edges and arcs resulted. Recently the notion of the blotting number denoted, of a graph was introduced. This prompted the thinking that the McPherson recursion could rather result in edges instead of arcs, and it was found that .
Published: January 15, 2018
AMS Subject Classification: 05C07, 05C20, 05C40, 05C75
Key Words and Phrases: McPherson number, McPherson recursion, blotting number
You will need Adobe Acrobat reader. For more information and free download of the reader, see the Adobe Acrobat website.
- J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London, 1976.
- F. Harary, Graph Theory, Addison-Wesley, Reading MA, 1969.
- J. Kok and C. Susanth, Introduction to the McPherson number, of a simple connected graph, Pioneer Journal of Mathematics and Mathematical Sciences, 13, No. 2 (2015), 91-102.
- C. Susanth, S.J. Kalayathankal, and N.K. Sudev, A note on McPherson number of graphs, Journal of Informatics and Mathematical Sciences, 8, No. 2 (2016), 123-127.
- C. Susanth, S.J. Kalayathankal, and N.K. Sudev, A study on blotting number of graphs, Journal of Informatics and Mathematical Sciences, To Appear.
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 431 - 435