Jobby Jacob
Associate Professor
School of Mathematics and Statistics
College of Science
585-475-5146
Office Hours
Fall 2022: Tu.We.Th.: 9:30 - 10:30 am, and by appointment.
Office Location
Jobby Jacob
Associate Professor
School of Mathematics and Statistics
College of Science
Education
BS, Bharata Mata College (India); MS, Indian Institute of Technology (India); Ph.D., Clemson University
Select Scholarship
Invited Keynote/Presentation
Jacob, Jobby. "Rankings (ordered colorings) of Graphs." Math. Colloquium. Hobart and William Smith Colleges. Geneva, NY. 11 Apr. 2019. Keynote Speech.
Jacob, Jobby. "L(h,k) labelings and rankings of some dense graphs." Thirty-second Midwest Conference on Combinatorics, Cryptography, and Computing. University of Minnesota. Duluth, MN. 6 Oct. 2018. Conference Presentation.
Jacob, Jobby. "Graph labeling based on distance one and distance two." MAA Seaway Section Meeting. SUNY. Brockport, NY. 13 Apr. 2018. Conference Presentation.
Jacob, Jobby. "Graph labelings." Math. Colloquim. Bharata Mata College. Kochi, Kerala, India. 0 Oct. 2017. Keynote Speech.
Jacob, Jobby. "Rank numbers of some Cartesian products involving complete graphs." AMS Sectional Meeting. University of Buffalo. Buffalo, NY. 0 Sep. 2017. Conference Presentation.
Jacob, Jobby. "A generalization of vertex rankings of graphs." The Japanese Conference on Combinatorics and its Applications. Kyoto University. Kyoto, Japan. 0 May 2016. Conference Presentation.
Jacob, Jobby. "Graph rankings based on l_p norms." AMS Special Session on Studies in Interconnections among Parameters in Graph Theory, Combinatorics, and Discrete Geometry. Joint Mathematics Meeting. San Antonio, TX. 13 Jan. 2015. Conference Presentation.
Jacob, Jobby. "Rankings of certain Cartesian products of graphs." 46th Southeastern International Conference on CGTC. Florida Atlantic University. Boca Raton, FL. 0 Mar. 2015. Conference Presentation.
Jacob, Jobby. "On L(2,1) labeling of trees." Joint Mathematics Meetings. AMS. Baltimore, MD. 0 Jan. 2014. Conference Presentation.
Jacob, Jobby. "Rank numbers of some graphs that are combinations of paths and cycles." 44th Southeastern International Conference on CGTC. Florida Atlantic University. Boca Raton, FL. 0 Mar. 2013. Conference Presentation.
Jacob, Jobby. "Two graph colorings." Math Colloqium. Houghton College. Houghton, NY. 0 Jan. 2013. Keynote Speech.
Jacob, Jobby. "On the irreducible no-hole L(h,k) labeling of graphs." 43rd Southeastern International Conference on CGTC. Florida Atlantic University. Boca Raton, FL. 0 Mar. 2012. Conference Presentation.
Jacob, Jobby. "From zero optimal to max optimal graph rankings." Special Session on My Favorite Graph Theory Conjectures. AMS Joint Mathematics Meetings. Boston, MA. 0 Jan. 2012. Conference Presentation.
Jacob, Jobby. "L(2,1) Span and inh-L(2,1) Span of Graphs." 42nd Southeastern International Conference on CGTC. Florida Atlantic University. Boca Raton, FL. 0 Mar. 2011. Conference Presentation.
Jacob, Jobby. "Graph labeling with Distance Two Constraints." Joint MAthematics Meetings. AMS. New Orleans, LA. 0 Jan. 2011. Conference Presentation.
Jacob, Jobby. "Towers of Hanoi and Rankings of Graphs." Math Colloqium. SUNY Geneseo. Geneseo, NY. 0 Nov. 2010. Keynote Speech.
Jacob, Jobby. "Irreducible No-Hole L(2,1) Labelings of Some Classes of Graphs." Joint Mathematics Meetings. AMS. San Francisco, CA. 0 Jan. 2010. Conference Presentation.
Jacob, Jobby. "On the Irreducible No-Hole L(2, 1) Labeling of Graphs." 23rd MCCCC. RIT. Rochester, NY. 0 Oct. 2009. Conference Presentation.
Journal Paper
Dobosh, Korrine, Samuel Kennedy, and Jobby Jacob. "On the rank number of the Cartesian product Km X Kn for small values of m." Journal of Graph Labeling. (2018): 1. Web.
Jacob, Bonnie and Jobby Jacob. "lp-optimal rankings and max-optimal rankings are different." Graphs and Combinatorics. (2017): 1473–1483. Print.
Jacob, Jobby and Christopher Wood. "A complete L(2,1) span characterization for small trees." AKCE International Journal of Graphs and Combinatorics.. (2015): 26-31. Print.
Jacob, Jobby. "Experiences of working with undergraduate students on research during an academic year." Involve. (2014): 363-367. Print.
Jacob, Jobby, et al. "Rank numbers for bent ladders." Discussiones Mathematicae. Graph Theory. (2014): 309-329. Print.
Blake, Brianna, Elizabeth Field, and Jobby Jacob. "Rank numbers of graphs that are combinations of paths and cycles." Involve. (2013): 369–381. Print.
Jacob, Jobby, et al. "Taking the convoluted out of Bernoulli convolutions: a discrete approach." Integers. (2013): 12. Web.
Jacob, Jobby, et al. "Minimal Rankings of the Cartesian Product Kn x Kn." Discussiones Mathematicae Graph Theory 32. 4 (2012): 725-736. Print.
Jacob, Bonnie and Jobby Jacob. "Infinite graphs with finite lp-rank number: a characterization." Congressus Numerantium.. (2012): 23-31. Print.
Held, Ryan and Jobby Jacob. "On the irreducible no-hole L(h,k) coloring of graphs." Congressus Numerantium.. (2012): 155-166. Print.
Jacob, Jobby and Ryan Held. "On the graphs whose L(2,1)-span is the same as their inh L(2,1)-span." Congressus Numerantium 210. (2011): 169-179. Print.
Jacob, Jobby, Renu Laskar, and John Villalpando. "On the irreducible no-hole L(2,1) coloring of bipartite graphs and Cartesian products." Journal of Combinatorial Mathematics and Combinatorial Computing. (2011): 49-64. Print.
Jacob, Jobby, et al. "Rank numbers for some trees and unicyclic graphs." Aequationes Mathematicae. (2011): 65-79. Print.
Jacob, Jobby, et al. "Discrete Bernoulli convolutions: an algorithmic approach toward bound improvement." Proceedings of the American Mathematical Society. (2011): 1579-1584. Print.
Jacob, Jobby, Renu Laskar, and Jeremy Lyle. "Variations of graph coloring, domination, and combinations of both: a brief survey." Ramanujan Mathematical Society Lecture Notes Series. (2010): 133-152. Print.
Currently Teaching
MATH-241
Linear Algebra
3 Credits
This course is an introduction to the basic concepts of linear algebra, and techniques of matrix manipulation. Topics include linear transformations, Gaussian elimination, matrix arithmetic, determinants, vector spaces, linear independence, basis, null space, row space, and column space of a matrix, eigenvalues, eigenvectors, change of basis, similarity and diagonalization. Various applications are studied throughout the course.
MATH-251
Probability and Statistics
3 Credits
This course introduces sample spaces and events, axioms of probability, counting techniques, conditional probability and independence, distributions of discrete and continuous random variables, joint distributions (discrete and continuous), the central limit theorem, descriptive statistics, interval estimation, and applications of probability and statistics to real-world problems. A statistical package such as Minitab or R is used for data analysis and statistical applications.
MATH-645
Graph Theory
3 Credits
This course introduces the fundamental concepts of graph theory. Topics to be studied include graph isomorphism, trees, network flows, connectivity in graphs, matchings, graph colorings, and planar graphs. Applications such as traffic routing and scheduling problems will be considered.