S. K. Vaidya

662 total citations
98 papers, 417 citations indexed

About

S. K. Vaidya is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, S. K. Vaidya has authored 98 papers receiving a total of 417 indexed citations (citations by other indexed papers that have themselves been cited), including 91 papers in Computational Theory and Mathematics, 36 papers in Electrical and Electronic Engineering and 14 papers in Computer Networks and Communications. Recurrent topics in S. K. Vaidya's work include Graph Labeling and Dimension Problems (77 papers), Advanced Graph Theory Research (48 papers) and graph theory and CDMA systems (35 papers). S. K. Vaidya is often cited by papers focused on Graph Labeling and Dimension Problems (77 papers), Advanced Graph Theory Research (48 papers) and graph theory and CDMA systems (35 papers). S. K. Vaidya collaborates with scholars based in India. S. K. Vaidya's co-authors include and has published in prestigious journals such as SHILAP Revista de lepidopterología, Modern Applied Science and Miskolc mathematical notes/Mathematical notes.

In The Last Decade

S. K. Vaidya

83 papers receiving 345 citations

Peers

S. K. Vaidya

CTM

EEE

GT

CNC

DMC

Zhengke Miao China

Dorota Kuziak Spain

Linda Eroh United States

María Luz Puertas Spain

Dalibor Fronček United States

Joe Ryan Australia

Rinovia Simanjuntak Indonesia

Toru Hasunuma Japan

Ebrahim Salehi United States

A.N.M. Salman Indonesia

Zhengke Miao China

S. K. Vaidya

224 ×0.6

CTM

63 ×0.4

EEE

49 ×0.6

GT

44 ×1.3

CNC

61 ×2.7

DMC

Citations per year, relative to S. K. Vaidya S. K. Vaidya (= 1×) peers Zhengke Miao

Countries citing papers authored by S. K. Vaidya

Since Specialization

Citations

This map shows the geographic impact of S. K. Vaidya'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 S. K. Vaidya with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. K. Vaidya more than expected).

Fields of papers citing papers by S. K. Vaidya

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. K. Vaidya. 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 S. K. Vaidya. The network helps show where S. K. Vaidya may publish in the future.

No nodes

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Vaidya, S. K., et al.. (2024). Some Borderenergetic and Equienergetic Graphs. Kragujevac Journal of Mathematics. 48(6). 935–949.

2.

Vaidya, S. K., et al.. (2020). On restrained edge dominating set of graphs. Malaya Journal of Matematik. 8(1). 28–31. 1 indexed citations

3.

Vaidya, S. K., et al.. (2019). On chromatic transversal domination in graphs. Malaya Journal of Matematik. 7(3). 419–422.

4.

Vaidya, S. K., et al.. (2018). On total domination and total equitable domination in graphs. Malaya Journal of Matematik. 6(2). 375–380. 2 indexed citations

5.

Vaidya, S. K., et al.. (2016). Independent Domination in Some Wheel Related Graphs. Applications and Applied Mathematics: An International Journal (AAM). 11(1). 27.

6.

Vaidya, S. K., et al.. (2015). Graphs with Equal Domination and Independent Domination Number. DSpace - Isik (Işık University). 5(1). 74–79. 1 indexed citations

7.

Vaidya, S. K., et al.. (2014). Embedding and NP-complete Problems for Some Equitable Labelings. SHILAP Revista de lepidopterología.

8.

Vaidya, S. K., et al.. (2014). b-Chromatic number of some wheel related graphs. Malaya Journal of Matematik. 2(4). 482–488. 3 indexed citations

9.

Vaidya, S. K., et al.. (2014). Product cordial labeling for alternate snake graphs. Malaya Journal of Matematik. 2(3). 188–196. 3 indexed citations

10.

Vaidya, S. K., et al.. (2013). Radio Number for Strong Product } $ P_2 \otimes P_n$. Malaya Journal of Matematik. 1(2). 29–36. 4 indexed citations

11.

Vaidya, S. K., et al.. (2013). Total edge product cordial labeling of graphs. Malaya Journal of Matematik. 1(3). 55–63. 5 indexed citations

12.

Vaidya, S. K., et al.. (2012). Edge product cordial labeling of graphs. Journal of Mathematical and Computational Science. 2(5). 1436–1450. 25 indexed citations

13.

Vaidya, S. K., et al.. (2011). Labeling cacti with a condition at distance two. SHILAP Revista de lepidopterología. 5 indexed citations

14.

Vaidya, S. K., et al.. (2011). E-Cordial Labeling for Cartesian Product of Some Graphs. 3(2). 11–15. 1 indexed citations

15.

Vaidya, S. K., et al.. (2011). Some Strongly Multiplicative Graphs in the Context of Arbitrary Supersubdivision. 3(1). 60–64.

16.

Vaidya, S. K.. (2011). Fibonacci and Super Fibonacci Graceful Labeling of Some Graphs. 2(2). 24–35. 1 indexed citations

17.

Vaidya, S. K., et al.. (2010). The L(2,1)-Labeling of Some Middle Graphs. SHILAP Revista de lepidopterología. 2 indexed citations

18.

Vaidya, S. K., et al.. (2010). Some New Product Cordial Graphs. SHILAP Revista de lepidopterología. 6 indexed citations

19.

Vaidya, S. K., et al.. (2010). Index of cordiality for complete graphs and cycle. 2(4). 38–46. 1 indexed citations

20.

Vaidya, S. K., et al.. (2010). Odd Graceful Labeling of Some New Graphs. Modern Applied Science. 4(10). 4 indexed citations

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.

Explore authors with similar magnitude of impact