Ranjan N. Naik
{{Db-g7|rationale=See [[user talk:At-Bankikodla#Your submission at Articles for creation: Ranjan N. Naik (May 30)}}
Script error: No such module "Draft topics".
Script error: No such module "AfC topic".
| Ranjan N. Naik | |
|---|---|
| Born | |
| 🏫 Education | 1977 Ph.D. from the University of Mumbai |
| 🎓 Alma mater | University of Mumbai |
| 💼 Occupation | |
| Known for | Frequency partition, Intersection Graphs of Linear Hypergraphs, Degree sequences, Bivariegated Graphs |
| Twitter= | |
Ranjan N. Naik is a professor of mathematics working at Lincoln University, PA, USA. He joined Lincoln University in 2007 after working three years for Rowan University, N.J., USA. Naik is known for his work on intersection graphs of hypergraphs, frequency partitions [2] [3][4], degree sequences [5], bivariegated graphs [6] [7] [8], and graph equations [9]. He earned a Ph.D. in graph theory in 1977 from the University of Mumbai. His work on intersection graphs of hypergraphs jointly with S. S. Shrikhande, Navin Singhi and S. B. Rao is a significant contribution to the theory of hypergraphs. [10] [11]
References[edit]
- ↑ Ranjan N. Naik at the Mathematics Genealogy Project
- ↑ Rao, Siddani Bhaskara; Bhat-Nayak, Vasanti N.; Naik, Ranjan N. (1979), "Characterization of frequency partitions of Eulerian graphs", Proceedings of the Symposium on Graph Theory (Indian Statist. Inst., Calcutta, 1976), ISI Lecture Notes, 4, Macmillan of India, New Delhi, pp. 124–137, MR 0553937. Also in Lecture Notes in Mathematics, Combinatorics and Graph Theory, Springer-Verlag, New York, Vol. 885 (1980), p 500.
- ↑ *Bhat-Nayak, Vasanti N.; Naik, Ranjan N.; Rao, S. B. (1977), "Frequency partitions: forcibly pancyclic and forcibly nonhamiltonian degree sequences", Discrete Mathematics, 20: 93–102, doi:10.1016/0012-365x(77)90049-8 Unknown parameter
|name-list-style=ignored (help) - ↑ Bhat-Nayak, V. N.; Naik, R. N. (1985), "Frequency partitions of k-uniform hypergraphs", Utilitas Math., 28: 99–104 Unknown parameter
|name-list-style=ignored (help) - ↑ S. B. Rao, A survey of the theory of potentially p-graphic and forcibly p-graphic sequences, in: S. B. Rao edited., Combinatorics and Graph Theory Lecture Notes in Math., Vol. 885 (Springer, Berlin, 1981), 417-440
- ↑ *Bhat-Nayak, Vasanti N.; Choudum, S. A.; Naik, Ranjan N. (1978), "Characterization of 2-variegated graphs and of 3-variegated graphs", Discrete Mathematics, 23: 17–22, doi:10.1016/0012-365X(78)90182-6.
- ↑ *Bhat-Nayak, Vasanti N.; Kocay, W. L.; Naik, Ranjan N. (1980), "Forcibly 2-variegated degree sequences", Utilitas Math., 18: 83–89.
- ↑ * Bhat-Nayak Vasanti N., Ranjan N. Naik, Further results on 2-variegated graphs, Utilitas Math. 12 (1977) 317–325.
- ↑ * Solutions of some further graph equations, Vasanti N. Bhat-Nayak, Ranjan N. Naik – Discrete Mathematics, 47 (1983) 169–175.
- ↑ {{[1] Survey on Intersection Graphs of Linear Hypergraphs}}
- ↑ *Berge, C. (1989), Hypergraphs: Combinatorics of Finite Sets, Amsterdam: North-Holland, MR 1013569. Translated from the French. This book references the work page 9-11.
- Naik, Ranjan N.; Rao, S. B.; Shrikhande, S. S.; Singhi, N. M. (1980), "Intersection graphs of k-uniform hypergraphs", Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978), Annals of Discrete Mathematics, 6, pp. 275–279, MR 0593539.
- Naik, Ranjan N.; Rao, S. B.; Shrikhande, S. S.; Singhi, N. M. (1982), "Intersection graphs of k-uniform linear hypergraphs", European Journal of Combinatorics, 3 (2): 159–172, doi:10.1016/s0195-6698(82)80029-2, MR 0670849.
External links[edit]
   | This Indian academic-related biographical article is a stub. You can help EverybodyWiki by expanding it. |
This article "Ranjan N. Naik" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Ranjan N. Naik. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
