default search action
Christopher Melekian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j11]Jing Li
, Chris Melekian
Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements. Int. J. Found. Comput. Sci. 31(3): 371-383 (2020)
2010 – 2019
- 2019
- [j10]Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian:
Fractional matching preclusion for generalized augmented cubes. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j9]Eddie Cheng
Strong matching preclusion problem of the folded Petersen cube. Int. J. Comput. Math. Comput. Syst. Theory 4(1): 1-15 (2019) - [j8]Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng:
Steiner Distance in Join, Corona, Cluster, and Threshold Graphs. J. Inf. Sci. Eng. 35(4): 721-735 (2019) - [j7]Pranav Arunandhi, Eddie Cheng
A Note on the Steiner k-Diameter of Tensor Product Networks. Parallel Process. Lett. 29(2): 1950008:1-1950008:7 (2019) - [j6]Zhao Wang, Christopher Melekian, Eddie Cheng
Matching preclusion number in product graphs. Theor. Comput. Sci. 755: 38-47 (2019) - [j5]Christopher Melekian, Eddie Cheng
A note on generalized matching preclusion in bipartite graphs. Theor. Comput. Sci. 791: 132-140 (2019) - 2018
- [j4]Yaping Mao, Christopher Melekian, Eddie Cheng
A note on the Steiner -diameter of a graph. Int. J. Comput. Math. Comput. Syst. Theory 3(1): 41-46 (2018) - [j3]Sai Antantapantula, Christopher Melekian, Eddie Cheng
Matching Preclusion for the Shuffle-Cubes. Parallel Process. Lett. 28(3): 1850012:1-1850012:9 (2018) - [j2]Yaping Mao
Strong matching preclusion number of graphs. Theor. Comput. Sci. 713: 11-20 (2018) - [c2]Tianlong Ma, Yaping Mao, Eddie Cheng
Fractional Matching Preclusion for (Burnt) Pancake Graphs. I-SPAN 2018: 133-141 - 2017
- [c1]Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng
Steiner Distance in Join, Corona and Threshold Graphs. ISPAN-FCST-ISCC 2017: 100-104 - 2015
- [j1]Eddie Cheng
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube. Theor. Comput. Sci. 576: 30-44 (2015)
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-07-25 19:32 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: