Roslan Hasni

576 total citations
97 papers, 395 citations indexed

About

Roslan Hasni is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Organic Chemistry. According to data from OpenAlex, Roslan Hasni has authored 97 papers receiving a total of 395 indexed citations (citations by other indexed papers that have themselves been cited), including 80 papers in Computational Theory and Mathematics, 59 papers in Geometry and Topology and 26 papers in Organic Chemistry. Recurrent topics in Roslan Hasni's work include Graph theory and applications (59 papers), Graph Labeling and Dimension Problems (42 papers) and Computational Drug Discovery Methods (31 papers). Roslan Hasni is often cited by papers focused on Graph theory and applications (59 papers), Graph Labeling and Dimension Problems (42 papers) and Computational Drug Discovery Methods (31 papers). Roslan Hasni collaborates with scholars based in Malaysia, Pakistan and Saudi Arabia. Roslan Hasni's co-authors include Ali Ahmad, Mohamad Nazri Husin, Muhammad Imran, ‎Saeid Alikhani, Muhammad Faisal Nadeem, Nader Jafari Rad, Doost Ali Mojdeh, Abdul Jalil M. Khalaf, Zhibin Du and Seyed Mahmoud Sheikholeslami and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Access and Molecules.

In The Last Decade

Roslan Hasni

74 papers receiving 376 citations

Peers

Roslan Hasni
Roslan Hasni
Citations per year, relative to Roslan Hasni Roslan Hasni (= 1×) peers Sakander Hayat

Countries citing papers authored by Roslan Hasni

Since Specialization
Citations

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

Fields of papers citing papers by Roslan Hasni

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Roslan Hasni

This figure shows the co-authorship network connecting the top 25 collaborators of Roslan Hasni. A scholar is included among the top collaborators of Roslan Hasni based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Roslan Hasni. Roslan Hasni is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Raza, Zahid, Shehnaz Akhter, & Roslan Hasni. (2025). Maximal first Zagreb connection index of trees with given total domination number. Discrete Applied Mathematics. 368. 82–90. 1 indexed citations
2.
Shahzad, Muhammad, et al.. (2024). Computing the Edge Irregularity Strength of Some Classes of Grid Graphs. 18(3). 617–630.
3.
Shahzad, Muhammad, et al.. (2024). Computing Edge Irregularity Strength of Star and Banana Trees Using Algorithmic Approach. Ars Combinatoria. 159(1). 11–20.
4.
Hasni, Roslan, et al.. (2024). Domination (totally) Dot-critical of Harary Graphs. 18(1). 1–7. 1 indexed citations
5.
Hasni, Roslan, et al.. (2023). Atom-Bond Connectivity and Geometric Arithmetic Indices of Dendrimer Nanostars. SHILAP Revista de lepidopterología. 22(11). 92–95.
6.
Hasni, Roslan, et al.. (2023). Maximum Second Zagreb Index Of Trees With Given Roman Domination Number. SHILAP Revista de lepidopterología.
7.
Hasni, Roslan, et al.. (2023). Circular q-Rung Orthopair Fuzzy Set and Its Algebraic Properties. 17(3). 363–378. 16 indexed citations
9.
Hasni, Roslan, et al.. (2021). On the edge irregularity strength for some classes of plane graphs. AIMS Mathematics. 6(3). 2724–2731. 5 indexed citations
10.
Hasni, Roslan, et al.. (2018). On the edge irregularity strength of disjoint union of star graph and subdivision of star graph.. Ars Combinatoria. 141. 93–100. 4 indexed citations
11.
Ahmad, Ali, et al.. (2018). Iterative algorithm for computing irregularity strength of complete graph.. Ars Combinatoria. 138. 17–24. 3 indexed citations
12.
Hasni, Roslan, et al.. (2018). A new family of chromatically unique 6-bridge graph. Proyecciones (Antofagasta). 37(2). 239–263. 1 indexed citations
13.
Rad, Nader Jafari, et al.. (2017). Pentacyclic Graphs with Maximal Estrada Index.. Ars Combinatoria. 133. 133–145. 4 indexed citations
14.
Hasni, Roslan, et al.. (2017). 3-total edge product cordial labeling of wheel related graphs. 93–102. 4 indexed citations
15.
Husin, Mohamad Nazri, et al.. (2016). Computation on Zagreb Polynomial of Some Families of Dendrimers. International journal of nanoscience and nanotechnology. 12(4). 243–249. 1 indexed citations
16.
Hasni, Roslan, et al.. (2016). Chromatically unique 6-bridge graph theta(a,a,a,b,b,c). Electronic Journal of Graph Theory and Applications. 4(1). 60–78.
17.
Husin, Mohamad Nazri, et al.. (2015). The edge version of geometric arithmetic index of nanotubes and nanotori. Optoelectronics and Advanced Materials Rapid Communications. 9. 1292–1300. 5 indexed citations
18.
Ahmad, Ali, Muhammad Faisal Nadeem, Imran Javaid, & Roslan Hasni. (2011). On the super edge-magic deficiency of some families related to ladder graphs.. Australas. J Comb.. 51. 201–208. 1 indexed citations
19.
Mojdeh, Doost Ali, et al.. (2010). On connected (γ, k)-critical graphs.. Australas. J Comb.. 46. 25–36. 6 indexed citations
20.
Mojdeh, Doost Ali & Roslan Hasni. (2010). On questions on (total) domination vertex critical graphs.. Ars Combinatoria. 96. 2 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

Rankless by CCL
2026