default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoslan Hasni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Sergio Bermudo, Roslan Hasni, Fateme Movahedi, Juan E. Nápoles Valdés:
The Geometric-Arithmetic index of trees with a given total domination number. Discret. Appl. Math. 345: 99-113 (2024)- 2023
- [j27]Siti Nurul Fitriah Mohamad, Roslan Hasni
, Florentin Smarandache:
Novel Concepts on Domination in Neutrosophic Incidence Graphs with Some Applications. J. Adv. Comput. Intell. Intell. Informatics 27(5): 837-847 (2023) - 2022
- [j26]G. Kirithiga Nandini, R. Sundara Rajan, T. M. Rajalaxmi, A. Arul Shantrinal, Sharifah Kartini Said Husain, Roslan Hasni:
Wiener index via wirelength of an embedding. Discret. Math. Algorithms Appl. 14(1): 2150087:1-2150087:19 (2022) - 2021
- [j25]Muhammad Ahsan Asim, Roslan Hasni, Ali Ahmad, Basem Assiri, Andrea Semanicová-Fenovcíková:
Irregularity Strength of Circulant Graphs Using Algorithmic Approach. IEEE Access 9: 54401-54406 (2021) - [j24]Kooi-Kuan Yoong, Roslan Hasni, Muhammad Irfan, Ibrahim Taraweh, Ali Ahmad, Sin-Min Lee:
On the edge irregular reflexive labeling of corona product of graphs with path. AKCE Int. J. Graphs Comb. 18(1): 53-59 (2021) - [j23]Siti Nurul Fitriah Mohamad, Roslan Hasni, Florentin Smarandache, Binyamin Yusoff:
Novel Concept of Energy in Bipolar Single-Valued Neutrosophic Graphs with Applications. Axioms 10(3): 172 (2021) - 2020
- [j22]Ali Ahmad, Roslan Hasni, Kashif Elahi, Muhammad Ahsan Asim:
Polynomials of Degree-Based Indices for Swapped Networks Modeled by Optical Transpose Interconnection System. IEEE Access 8: 214293-214299 (2020) - [j21]Ibrahim Tarawneh, Roslan Hasni, Ali Ahmad:
On the edge irregularity strength of grid graphs. AKCE Int. J. Graphs Comb. 17(1): 414-418 (2020) - [j20]Ibrahim Tarawneh, Roslan Hasni, Ali Ahmad, Gee-Choon Lau, Sin-Min Lee:
On the edge irregularity strength of corona product of graphs with cycle. Discret. Math. Algorithms Appl. 12(6): 2050083:1-2050083:18 (2020) - [j19]Wan Nor Nabila Nadia Wan Zuki, Zhibin Du, Muhammad Kamran Jamil, Roslan Hasni:
Extremal Trees with Respect to the Difference between Atom-Bond Connectivity Index and Randić Index. Symmetry 12(10): 1591 (2020)
2010 – 2019
- 2019
- [i1]Rudrusamy U. Gobithaasan, Nurul Syaheera Din, Lingeswaran Ramachandra, Roslan Hasni:
Boosting Students' Performance With The Aid Of Social Network Analysis. CoRR abs/1906.04352 (2019) - 2018
- [j18]Muhammad Ahsan Asim, Ali Ahmad, Roslan Hasni:
Iterative algorithm for computing irregularity strength of complete graph. Ars Comb. 138: 17-24 (2018) - [j17]Ibrahim Tarawneh, Roslan Hasni, Muhammad Ahsan Asim:
On the edge irregularity strength of disjoint union of star graph and subdivision of star graph. Ars Comb. 141: 93-100 (2018) - [j16]Noor A'lawiah Abd Aziz, Nader Jafari Rad, Hailiza Kamarulhaili, Roslan Hasni:
Bounds for the Independence Number in k-Step Hamiltonian Graphs. Comput. Sci. J. Moldova 26(1): 15-28 (2018) - [j15]Muhammad Imran, Abdul Qudair Baig, Shafiq Ur Rehman, Haidar Ali, Roslan Hasni:
Computing topological polynomials of mesh-derived networks. Discret. Math. Algorithms Appl. 10(6): 1850077:1-1850077:25 (2018) - 2017
- [j14]Nader Jafari Rad, Akbar Jahanbani, Roslan Hasni:
Pentacyclic Graphs with Maximal Estrada Index. Ars Comb. 133: 133-145 (2017) - [j13]Mohamad Nazri Husin, Roslan Hasni, Muhammad Imran:
More results on computation of topological indices of certain networks. Int. J. Netw. Virtual Organisations 17(1): 46-63 (2017) - 2016
- [j12]Ibrahim Tarawneh, Roslan Hasni, Ali Ahmad:
On the edge irregularity strength of corona product of cycle with isolated vertices. AKCE Int. J. Graphs Comb. 13(3): 213-217 (2016) - [j11]N. S. A. Karim, Roslan Hasni, Gee-Choon Lau:
Chromatically unique 6-bridge graph theta(a, a, a, b, b, c). Electron. J. Graph Theory Appl. 4(1): 60-78 (2016) - 2014
- [j10]Sabina Catada-Ghimire, Roslan Hasni:
New result on chromaticity of K4-homeomorphic graphs. Int. J. Comput. Math. 91(5): 834-843 (2014) - 2013
- [j9]Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
On the outer-connected domination in graphs. J. Comb. Optim. 26(1): 10-18 (2013) - 2012
- [j8]Sabina Catada-Ghimire, Roslan Hasni:
Chromatic Uniqueness of K4-Homeomorphic Graphs. Ars Comb. 103: 97-108 (2012) - [j7]Roslan Hasni, Sabina Catada-Ghimire:
Chromatic Uniqueness of A Family of K4-Homeomorphs. Ars Comb. 107: 419-430 (2012) - 2011
- [j6]Ali Ahmad, Muhammad Faisal Nadeem, Imran Javaid, Roslan Hasni:
On the super edge-magic deficiency of some families related to ladder graphs. Australas. J Comb. 51: 201-208 (2011) - [j5]Roslan Hasni, Y. H. Peng:
Chromatic Uniqueness of Complete Bipartite Graphs With Certain Edges Deleted. Ars Comb. 98: 203-213 (2011) - [j4]Roslan Hasni, Y. H. Peng:
Chromaticity of Bipartite Graphs With Seven Edges Deleted. Ars Comb. 99: 257-277 (2011) - 2010
- [j3]Doost Ali Mojdeh, P. Firoozi, Roslan Hasni:
On connected (γ, k)-critical graphs. Australas. J Comb. 46: 25-36 (2010) - [j2]Doost Ali Mojdeh, Roslan Hasni:
On questions on (total) domination vertex critical graphs. Ars Comb. 96 (2010) - [j1]Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Inequalities of Nordhaus-Gaddum type for doubly connected domination number. Discret. Appl. Math. 158(14): 1465-1470 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
