Sunil Thakare

Sunil Thakare

Auto-generated profile, based on publicly available information

Sunil Thakare

Department of Mathematics, School of Engineering and Sciences, MIT Art, Design and Technology University, Pune, India

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 September 2023 in Communications in Mathematics and Applications
Verified
Journal Article
Open access
PDF file
STSunil Thakare
Sunil Thakare
HBHaribhau Bhapkar
Haribhau Bhapkar
We defined the concept of \(\pi\)-coloring of graphs and incident vertex \(\pi\) coloring of graphs. The incident vertex \(\pi\) coloring number \((IV \pi CN)\) of graphs is different from all existing coloring techniques. The \(IV \pi CN\) of complete graph \((K_n)\) is \(n\). \(IV \pi CN\) of wheel, star, double star graph are \((n+1)\). Also, \(IV \pi CN\) of friendship, diamond and fan graphs are \(\Delta+1\). The \(IV \pi CN\) of double fan graph is \(\Delta+2\). The \(IV \pi CN\) of complete bipartite graphs \(K_{m,n}\) is \((m+n)\). The \(IV \pi CN\) of bipartite graph is bounded. Moreover, some results associated to enumeration of the number of graphs having equal incident vertex \(\pi\) chromatic number of few families are proved.