default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazem Khashyarmanesh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Zinat Rastgar, Kazem Khashyarmanesh, Mojgan Afkhami:
On the distinguishing chromatic number of the Kronecker products of graphs. AKCE Int. J. Graphs Comb. 21(1): 63-70 (2024)- 2023
- [j13]Arazgol Ghajari, Kazem Khashyarmanesh, Taher Abualrub, Irfan Siap:
ℤ4R-additive cyclic and constacyclic codes and MDSS codes. Discret. Math. Algorithms Appl. 15(1): 2250066:1-2250066:21 (2023) - 2022
- [j12]Afsaneh Rezaei, Kazem Khashyarmanesh, Mojgan Afkhami:
On the metric dimension of Cayley graphs. AKCE Int. J. Graphs Comb. 19(2): 118-124 (2022) - 2021
- [j11]Mohsen Alinejad, Kazem Khashyarmanesh
:
Counting short cycles of (c, d)-regular bipartite graphs. Discret. Math. Algorithms Appl. 13(3): 2150022:1-2150022:21 (2021) - 2018
- [j10]Hamid Reza Barani, Kazem Khashyarmanesh, Freydoon Rahbarnia:
On The Generalized Cayley Graphs Of Power Set Rings And Hamiltonian Cycles. Ars Comb. 138: 365-380 (2018) - [j9]Zohreh Rajabi, Kazem Khashyarmanesh:
Repeated-root two-dimensional constacyclic codes of length 2ps.2k. Finite Fields Their Appl. 50: 122-137 (2018) - 2017
- [j8]Zohreh Rajabi, Kazem Khashyarmanesh:
Some cyclic codes from some monomials. Appl. Algebra Eng. Commun. Comput. 28(6): 469-495 (2017) - [j7]Mojgan Afkhami, Mohammad Farrokhi Derakhshandeh Ghouchan, Kazem Khashyarmanesh:
Planar, Outerplanar And Ring Graph Cozero-Divisor Graphs. Ars Comb. 131: 397-406 (2017) - [j6]Mojgan Afkhami, Masoud Karimi, Kazem Khashyarmanesh:
On The Planarity Of The Regular Digraph Of Ideals Of Commutative Rings. Ars Comb. 134: 403-423 (2017) - 2016
- [j5]Zahra Sepasdar, Kazem Khashyarmanesh:
Characterizations of some two-dimensional cyclic codes correspond to the ideals of F[x, y]/<xs-1, y2k-1>. Finite Fields Their Appl. 41: 97-112 (2016) - 2015
- [j4]Mojgan Afkhami, Zahra Barati, Seyede Nesa Hoseini, Kazem Khashyarmanesh:
A generalization of commuting graphs. Discret. Math. Algorithms Appl. 7(1): 1450068:1-1450068:11 (2015) - [j3]Abbas Erfanian, Kazem Khashyarmanesh, Kh. Nafar:
Non-commuting graphs of rings. Discret. Math. Algorithms Appl. 7(3): 1550027:1-1550027:7 (2015) - 2014
- [j2]Mojgan Afkhami, Kazem Khashyarmanesh:
The intersection graph of ideals of a poset. Discret. Math. Algorithms Appl. 6(3) (2014) - 2013
- [j1]Mojgan Afkhami, Kazem Khashyarmanesh:
Total graphs of Polynomial Rings and Rings of fractions. Discret. Math. Algorithms Appl. 5(4) (2013)
Informal and Other Publications
- 2018
- [i1]Mohsen Alinejad, Kazem Khashyarmanesh:
Counting short cycles of (c, d)-regular bipartite graphs. CoRR abs/1808.00352 (2018)
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-09 21:16 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:
