Navin M. Singhi | Academic Influence

Navin M. Singhi's AcademicInfluence.com Rankings

Navin M. Singhi

Mathematics

#3581

World Rank

#5262

Historical Rank

Measure Theory

#4988

World Rank

#5878

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Navin M. Singhi's Degrees

Bachelors Mathematics University of Calcutta

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Navin M. Singhi Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Navin Madhavprasad Singhi is an Indian mathematician and a Professor Emeritus at Tata Institute of Fundamental Research, Mumbai, specializing in combinatorics and graph theory. He is the recipient of the prestigious Shanti Swarup Bhatnagar Prize for Science and Technology. Singhi is known for his research in block designs, projective planes, Intersection graphs of hypergraphs, and coding theory. He was a visiting professor at IIT Mumbai, University of Mumbai, Indian Statistical Institute and other various universities in the United States and Europe.

(See a Problem?)

Navin M. Singhi's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Projective planes I (2010) (330)
First distribution invariants and EKR theorems (1988) (42)
Intersection Graphs of k-uniform Linear Hypergraphs (1982) (25)
ON INSTANTANEOUS CODES (2004) (21)
On functions of strengtht (1983) (19)
The minimal forbidden subgraphs for generalized line-graphs (1981) (19)
On a robustness property of PBIBD (1983) (19)
On existence and number of orthogonal arrays (1988) (18)
Graphs with eigenvalues at least −2 (1982) (15)
q-Analogues of t-designs and their existence (1989) (15)
On the Number of Latin Rectangles and Chromatic Polynomial of L(Kr, s) (1980) (13)
Embedding of quasi-residual designs (1974) (13)
Linear Dependencies among Subsets of a Finite Set (1983) (11)
A note on embedding of orthogonal arrays of strength two (1979) (10)
Some Properties of Perfect Matroid Designs (1980) (9)
On Existence of t-Designs with Large v and lambda (1988) (9)
Rigid pentagons in hypercubes (1988) (8)
Theory and Design of t-Unidirectional Error-Correcting and d-Unidirectional Error-Detecting Code (1994) (8)
Signed graphs with least eigenvalue <-2 (1992) (8)
A Reciprocity Relation for t-Designs (1987) (7)
Tags on Subsets (2003) (7)
Maximal arcs in designs (1985) (7)
On Sharply Edge-Transitive Permutation Groups (1981) (6)
Embedding of orthogonal arrays of strength two and deficiency greater than two (1979) (6)
(19, 9, 4) Hadamard Designs and Their Residual Designs (1974) (5)
Some recent results on signed graphs with least Eigenvalues > - 2 (1990) (4)
A non-constructible projective plane (1980) (4)
Intersection Graphs of k-Uniform Hypergraphs (1980) (4)
Nonisomorphic solutions of (4t+3, 2t+1, t) designs (1975) (4)
Embedding the affine complement of three intersecting lines in a finite projective plane (1977) (4)
Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications (1996) (3)
Positive independence and enumeration of codes with a given distance pattern (1990) (3)
Designs, adjacency multigraphs and embeddings: A survey (1981) (3)
Friendship 3-hypergraphs (2012) (3)
Algebraic, Extremal and Metric Combinatorics, 1986: Infinite Geometric Groups and Sets (1988) (3)
Further characterization of basic trades (1997) (2)
A multiprocessor communication architecture for high speed networks (1993) (2)
An elementary derivation of the annihilator polynomial for extremal (2s + 1)-designs (1990) (2)
Set-magic labelings of infinite graphs (2002) (2)
Regular Representation of Finite Groups by Hypergraphs (1978) (2)
S.S. Shrikhande and his work: an appreciation (2001) (1)
Combinatorics and applications : proceedings of the Seminar on Combinatorics and Applications in honour of S.S. Shrikhande, held at the Indian Statistical Institute, 14-17 December 1982 (1984) (1)
Note on islands in path-length sequences of binary trees (2014) (1)
Some approaches for solving the general (t, k)-design existence problem and other related problems (2013) (1)
Studying designs via multisets (2012) (1)
Partitions in Matrices and Graphs (1991) (0)
Spectral characterization of the line graph of Kℓn (1981) (0)
CHARACTERIZING CLIQUES IN HYPERGRAPH S (0)
The Induced Partial Order on the set of Finite Subsets of a Partially Ordered Set (2002) (0)
Towards the Ryser–Woodall λ $\lambda $ ‐design conjecture (2023) (0)
Infinite geometric groups and sets(Group and Algebraic Combinatorial Theory) (1987) (0)
On maximal instantaneous codes (2006) (0)
Reconstruction of hypergraphs from line graphs and degree sequences (2021) (0)
On Functions of Strenth t (1983) (0)
Tags on Lists and Steiner Systems (2009) (0)
Studying designs via multisets (2012) (0)
On a problem of Erdős and Larson (1985) (0)

This paper list is powered by the following services:

Other Resources About Navin M. Singhi

en.wikipedia.org

What Schools Are Affiliated With Navin M. Singhi?

Navin M. Singhi is affiliated with the following schools: