K.JOHN BOSCO

Assistant Professor
📚 ASSISTANT PROF | Kollankodu, Tamil Nadu, India
Mutual Connections
Loading...
S9-092023-0100187
2 Publications
0 Followers
0 Following
0 Questions

👤 About

Skills & Expertise

Analysis Mathematics Graph Theory Queue Theory

Research Interests

graph theory general topology queue theory analysis operation research

Connect With Me

💼 Experience

Assistant Professor

· August 2015 - Present

Assistant Professor

· June 2013 - September 2015

Lecturer

· June 2012 - June 2013

Assistant Professor

· June 2010 - June 2012

🎓 Education

Manonmaniam Sundaranar University (MSU)

Ph.D in Mathematics · 2019

Ph.D. in Mathematics(Graph Theory) · 2019

CSS computer centre, Trichy (College of Software Society)

HDCA in Computer Application · 2010

St. Joseph's College, Trichy (SJC)

M.Phil. in Mathematics · 2010

Urumu Dhanalakshmi College, Trichy

M.SC in Mathematics · 2009

St.Judes College

B. Sc. in Mathematics · 2005

🎤 Conferences & Seminars (3)

National Seminar on “ Recent Trends in Analysis and Graph Theory
St. Jude’s College · Kollankodu, Tamil Nadu, Country · January 2015
No descriptions
National conference on recent advances in pure and applied mathematics
St. Xavier’s College(Autonomous), Palayamkottai · City , State , Country · March 2014
No descriptions
International conference on applied mathematics and theoretical computer science
St. Xavier’s Catholic College of Engineering, Nagercoil (SXCCE) · Kollankodu, Tamil Nadu, Country · January 2013
No descriptions

Professional Memberships (1)

St.Judes College
Member: regular || Join dt: -
Country: India

📖 Role in Research Journals (3)

Journal: International Journal of Current Science || Publisher Name: ijcspub
IJCSP
Journal: INTERNATIONAL JOURNAL OF NOVEL RESEARCH AND DEVELOPMENT || Publisher Name: IJ Publication
IJNRD
Journal: International Journal of Engineering Research & Technology || Publisher Name: Unit of ESRSA Publications Pvt Ltd
IJERT

📚 Publications (2)

Journal: • June 2018
ℕ such that for two distinct vertices u and v of G, dD(u, v) + 𝑓 𝑢 +𝑓(𝑣) 2 ≥ 1 + diamD(G), where dD(u, v) denotes the D-distance between u and v and diamD(G) denotes the D-diameter of G....
Journal: • December 2016
A Radio Mean D-distance labeling of a connected graph G is an injective map f from the vertex set V(G) to the such that for two distinct vertices u and v of G, dD(u, v) + ≥ 1 + diamD(G),...
dd