The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs
C. Susanth, Sunny Joseph Kalayathankal
Journal of Advances in Mathematics and Computer Science · pp. 1–7 · Published 7 Oct 2015
10.9734/BJMCS/2016/20823Abstract
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as Nordhaus-Gaddum inequalities. In this paper, some variations on this result is studies. First, recall their theorem, which gives bounds on the sum and the product of the chromatic number of a graph with that of its complement. We also provide a new characterization of the certain graph classes.
Cited by 4
R. Fitriani, K. Sugeng, N. Hariadi · 2018
R. Uma, S. Divya · 2017
J. Kok, N. Sudev, M. Jamil · 2017
J. Kok, C. Susanth · 2014
Article metrics
Real usage data collected on this platform.
15
Page views
0
PDF downloads
1
Outbound clicks
4
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.