B. D. Acharya
Impact in
- Geometry and Topology top 5%
- Graph theory and applications
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
- Matrix Theory and Algorithms
Papers in
-
- Advanced Graph Theory Research 21
- Graph Labeling and Dimension Problems 17
- Complexity and Algorithms in Graphs 3
-
- Graph theory and applications 9
- Co-authors
- H.B. Walikar (3 shared papers)S. B. Rao (5 shared papers)İvan Gutman (2 shared papers)Harishchandra S. Ramane (2 shared papers)Purnima Gupta (5 shared papers)S. Arumugam (3 shared papers)Michel Las Vergnas (1 shared paper)Deepa Sinha (2 shared papers)
In The Last Decade
B. D. Acharya
28 papers receiving 250 citations
Peers
Comparison fields: 5 of 38
- Geometry and Topology 164
- Computational Theory and Mathematics 244
- Discrete Mathematics and Combinatorics 39
- Algebra and Number Theory 8
- Statistical and Nonlinear Physics 21
Countries citing papers authored by B. D. Acharya
This map shows the geographic impact of B. D. Acharya's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by B. D. Acharya with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites B. D. Acharya more than expected).
Fields of papers citing papers by B. D. Acharya
This network shows the impact of papers produced by B. D. Acharya. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by B. D. Acharya. The network helps show where B. D. Acharya may publish in the future.
Co-authors
The 13 scholars most cited alongside B. D. Acharya, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 32 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1980 | 71 | |
| 2 | 2005 | 41 | |
| 3 | 1991 | 41 | |
| 4 | 1990 | 31 | |
| 5 | Bounds for the distance energy of a graph | 2008 | 19 |
| 6 | 1997 | 13 | |
| 7 | 1982 | 12 | |
| 8 | 1982 | 12 | |
| 9 | Characterization of a Signed Graph Whose Signed Line Graph is S-Consistent | 2009 | 10 |
| 10 | 2009 | 7 | |
| 11 | 1999 | 7 | |
| 12 | 1999 | 7 | |
| 13 | Graphs, Combinatorics, Algorithms and Applications | 2005 | 6 |
| 14 | 2010 | 6 | |
| 15 | Unitary Addition Cayley Signed Graphs | 2013 | 5 |
| 16 | 2007 | 3 | |
| 17 | 2007 | 3 | |
| 18 | 1979 | 3 | |
| 19 | 1982 | 2 | |
| 20 | 2010 | 2 |
About B. D. Acharya
B. D. Acharya is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Computer Networks and Communications, having authored 32 papers that have together received 312 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (21 papers), Graph Labeling and Dimension Problems (17 papers), Graph theory and applications (9 papers), graph theory and CDMA systems (8 papers), Interconnection Networks and Systems (3 papers), Limits and Structures in Graph Theory (3 papers), Complexity and Algorithms in Graphs (3 papers) and Rings, Modules, and Algebras (2 papers). The work is most often cited by research in Geometry and Topology (164 citations), Computational Theory and Mathematics (244 citations), Discrete Mathematics and Combinatorics (39 citations), Algebra and Number Theory (8 citations) and Statistical and Nonlinear Physics (21 citations). B. D. Acharya has collaborated with scholars based in India, Serbia and Nepal. Frequent co-authors include H.B. Walikar, S. B. Rao, İvan Gutman, Harishchandra S. Ramane, Purnima Gupta, S. Arumugam, Michel Las Vergnas, Deepa Sinha, E. Sampathkumar and V. Swaminathan. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B, Journal of Graph Theory, PLoS ONE and Designs Codes and Cryptography.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.