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
-
- Limits and Structures in Graph Theory 3
- Co-authors
- H.B. WalikarHarishchandra S. RamaneS. B. Raoİvan GutmanPurnima GuptaS. ArumugamMichel Las VergnasE. Sampathkumar
In The Last Decade
B. D. Acharya
28 papers receiving 246 citations
Peers
Comparison fields: 5 of 38
- Geometry and Topology 163
- Computational Theory and Mathematics 245
- Discrete Mathematics and Combinatorics 38
- Statistical and Nonlinear Physics 20
- Algebra and Number Theory 7
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-authorship network
The 14 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
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 1 | |
| 2 | 2020 | 0 | |
| 3 | 2016 | 0 | |
| 4 | Unitary Addition Cayley Signed Graphs | 2013 | 5 |
| 5 | Characterization of a Signed Graph Whose Signed Line Graph is S-Consistent | 2009 | 8 |
| 6 | 2009 | 1 | |
| 7 | Bounds for the distance energy of a graph | 2008 | 19 |
| 8 | 2007 | 3 | |
| 9 | 2007 | 3 | |
| 10 | Domination in Discrete Structures - New Directions | 2007 | 1 |
| 11 | 2005 | 41 | |
| 12 | 2003 | 1 | |
| 13 | 1999 | 7 | |
| 14 | 1997 | 13 | |
| 15 | 1991 | 41 | |
| 16 | 1990 | 33 | |
| 17 | 1983 | 1 | |
| 18 | 1982 | 12 | |
| 19 | 1982 | 2 | |
| 20 | 1982 | 12 |
About B. D. Acharya
B. D. Acharya is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Algebra and Number Theory and Computer Graphics and Computer-Aided Design, having authored 32 papers that have together received 309 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), Complexity and Algorithms in Graphs (3 papers), Limits and Structures in Graph Theory (3 papers) and Graphene research and applications (2 papers). The work is most often cited by research in Geometry and Topology (163 citations), Computational Theory and Mathematics (245 citations), Discrete Mathematics and Combinatorics (38 citations), Statistical and Nonlinear Physics (20 citations) and Algebra and Number Theory (7 citations). B. D. Acharya has collaborated with scholars based in India, Serbia and France. Frequent co-authors include H.B. Walikar, Harishchandra S. Ramane, S. B. Rao, İvan Gutman, Purnima Gupta, S. Arumugam, Michel Las Vergnas, E. Sampathkumar, Deepa Sinha and K. A. Germina. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B, Journal of Graph Theory, Applied Mathematics Letters 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.