default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSk. Md. Abu Nayeem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Md. Abdus Sahir, Sk. Md. Abu Nayeem
:
On the Kirchhoff index and the number of spanning trees of cylinder/Möbius pentagonal chain. Discret. Appl. Math. 326: 47-61 (2023)- [i5]Md. Abdus Sahir, Sk. Md. Abu Nayeem:
On the degree-Kirchhoff index, Gutman index and the Schultz index of pentagonal cylinder/ Möbius chain. CoRR abs/2302.07170 (2023) - 2022
- [j10]Md. Abdus Sahir, Sk. Md. Abu Nayeem:
Aα spectra of graphs obtained by two corona operations and Aα cospectral graphs. Discret. Math. Algorithms Appl. 14(2): 2150112:1-2150112:20 (2022) - 2020
- [j9]Ruhul Amin, Sk. Md. Abu Nayeem:
Bounds for Kirchhoff index and Laplacian-energy-like invariant of some derived graphs of a regular graph. Discret. Math. Algorithms Appl. 12(02): 2050022 (2020)
2010 – 2019
- 2017
- [j8]Sarifa Khatun, Sk. Md. Abu Nayeem:
Graceful labeling of some zero divisor graphs. Electron. Notes Discret. Math. 63: 189-196 (2017) - [j7]Ruhul Amin, Sk. Md. Abu Nayeem:
Trees with minimum F-coindex. Electron. Notes Discret. Math. 63: 303-310 (2017) - 2016
- [j6]Nilanjan De, Sk. Md. Abu Nayeem, Anita Pal:
F-Index of some graph operations. Discret. Math. Algorithms Appl. 8(2): 1650025:1-1650025:17 (2016) - [j5]Nilanjan De, Sk. Md. Abu Nayeem, Anita Pal:
Erratum: "F-Index of some graph operations". Discret. Math. Algorithms Appl. 8(3): 1692001:1-1692001:1 (2016) - [i4]Ruhul Amin, Sk. Md. Abu Nayeem:
On the F-index and F-coindex of the line graphs of the subdivision graphs. CoRR abs/1608.01503 (2016) - [i3]Ruhul Amin, Sk. Md. Abu Nayeem:
Ordering Unicyclic Graphs with Respect to F-index. CoRR abs/1609.01128 (2016) - 2015
- [j4]Sk. Md. Abu Nayeem:
An expected value approach involving linear combination of possibility and necessity measures for a fuzzy EOQ model. J. Intell. Fuzzy Syst. 29(2): 761-767 (2015) - 2014
- [i2]Nilanjan De, Sk. Md. Abu Nayeem, Anita Pal:
Bounds for the modified eccentric connectivity index. CoRR abs/1402.1870 (2014) - [i1]Nilanjan De, Anita Pal, Sk. Md. Abu Nayeem:
Connective eccentric index of some graph operations. CoRR abs/1406.0378 (2014) - 2013
- [j3]Sk. Md. Abu Nayeem, Madhumangal Pal:
Diameter Constrained Fuzzy Minimum Spanning Tree Problem. Int. J. Comput. Intell. Syst. 6(6): 1040-1051 (2013) - 2012
- [c2]Sk. Md. Abu Nayeem:
An expected value model of quadratic clique problem on a graph with fuzzy parameters. ISDA 2012: 592-597 - [c1]Sk. Md. Abu Nayeem:
A New Expected Value Model for the Fuzzy Shortest Path Problem. SocProS 2012: 209-215
2000 – 2009
- 2005
- [j2]Sk. Md. Abu Nayeem, Madhumangal Pal:
Shortest Path Problem on a Network with Imprecise Edge Weight. Fuzzy Optim. Decis. Mak. 4(4): 293-312 (2005) - [j1]Sk. Md. Abu Nayeem, Madhumangal Pal:
Genetic algorithm to solve the p-centre and p-radius problem on a network. Int. J. Comput. Math. 82(5): 541-550 (2005)
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-04-24 22:47 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:
