default search action
Saeid Alikhani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Saeid Alikhani
, Davood Bakhshesh
Connected coalitions in graphs. Discuss. Math. Graph Theory 44(4): 1551-1566 (2024) - [i3]Saeid Alikhani, Davood Bakhshesh, Nima Ghanbari:
Counting the Number of Domatic Partition of a Graph. CoRR abs/2407.00103 (2024) - 2023
- [j29]Saeid Alikhani, Mohammad R. Piri:
On the edge chromatic vertex stability number of graphs. AKCE Int. J. Graphs Comb. 20(1): 29-34 (2023) - 2022
- [j28]Saeid Alikhani, Nima Ghanbari, Samaneh Soltani:
Total dominator chromatic number of k-subdivision of graphs. Art Discret. Appl. Math. 6(1): 1 (2022) - [j27]Saeid Alikhani, Mohammad Hadi Shekarriz:
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring. Art Discret. Appl. Math. 6(2): 2 (2022) - [j26]Gee-Choon Lau, Saeid Alikhani
More on the unimodality of domination polynomial of a graph. Discret. Math. Algorithms Appl. 14(4): 2150138:1-2150138:9 (2022) - 2021
- [j25]Nima Ghanbari
Mostar index and edge Mostar index of polymers. Comput. Appl. Math. 40(8) (2021) - [j24]Somayeh Jahari
On the independent domination polynomial of a graph. Discret. Appl. Math. 289: 416-426 (2021) - [j23]Saeid Alikhani
Distinguishing index of Kronecker product of two graphs. Electron. J. Graph Theory Appl. 9(1): 77-85 (2021) - [i2]Mohammad Zeynali Azim, Saeid Alikhani, Babak Anari:
Sequence pairs related to produced graphs from a method for dividing a natural number by two. CoRR abs/2111.04367 (2021) - 2020
- [j22]Saeid Alikhani
The distinguishing number and the distinguishing index of line and graphoidal graph(s). AKCE Int. J. Graphs Comb. 17(1): 1-6 (2020) - [j21]Saeid Alikhani
The chromatic distinguishing index of certain graphs. AKCE Int. J. Graphs Comb. 17(1): 131-138 (2020) - [j20]Ali Zeydi Abdian, Lowell W. Beineke, Mohammad Reza Oboudi
On the spectral determinations of the connected multicone graphs. AKCE Int. J. Graphs Comb. 17(1): 149-158 (2020) - [j19]Saeid Alikhani
Trees with distinguishing index equal distinguishing number plus one. Discuss. Math. Graph Theory 40(3): 875-884 (2020) - [i1]Mohammad Zeynali Azim, Mohammad Ali Jabraeil Jamali, Babak Anari, Saeid Alikhani, Shahin Akbarpour:
Graphs and codes produced by a new method for dividing a natural number by two. CoRR abs/2003.01691 (2020)
2010 – 2019
- 2019
- [j18]Saeid Alikhani, Davood Fatehi, Christina M. Mynhardt:
On k-total dominating graphs. Australas. J Comb. 73: 313-333 (2019) - [j17]Saeid Alikhani
Trees with distinguishing number two. AKCE Int. J. Graphs Comb. 16(3): 280-283 (2019) - [j16]Saeid Alikhani, Samaneh Soltani:
Distinguishing number and distinguishing index of neighbourhood corona of two graphs. Contributions Discret. Math. 14(1) (2019) - [j15]Saeid Alikhani
Symmetry breaking in planar and maximal outerplanar graphs. Discret. Math. Algorithms Appl. 11(1): 1950008:1-1950008:11 (2019) - 2018
- [j14]Saeid Alikhani
The distinguishing number and distinguishing index of the lexicographic product of two graphs. Discuss. Math. Graph Theory 38(3): 853-865 (2018) - [j13]Somayeh Jahari, Saeid Alikhani
Some families of graphs with no nonzero real domination roots. Electron. J. Graph Theory Appl. 6(1): 17-28 (2018) - [j12]Ali Sadeghieh, Nima Ghanbari
Computation of Gutman index of some cactus chains. Electron. J. Graph Theory Appl. 6(1): 138-151 (2018) - 2017
- [j11]Saeid Alikhani, Emeric Deutsch:
More on domination polynomial and domination root. Ars Comb. 134: 215-232 (2017) - [j10]Saeid Alikhani
On the Structure of Dominating Graphs. Graphs Comb. 33(4): 665-672 (2017) - 2016
- [c1]Saeid Alikhani
The Distinguishing Number of Kronecker Product of Two Graphs. ICTCSDM 2016: 341-346 - 2015
- [j9]Gee-Choon Lau
On k-edge-magic labelings of maximal outerplanar graphs. AKCE Int. J. Graphs Comb. 12(1): 40-46 (2015) - [j8]Saeid Alikhani
Randić energy of specific graphs. Appl. Math. Comput. 269: 722-730 (2015) - 2014
- [j7]Saeid Alikhani, Yee-Hock Peng:
Introduction to Domination Polynomial of a Graph. Ars Comb. 114: 257-266 (2014) - [j6]Saeid Alikhani
On the k-edge magic graphs. Electron. Notes Discret. Math. 45: 35-41 (2014) - 2013
- [j5]Saeid Alikhani
Some new results on domination roots of a graph. Electron. Notes Discret. Math. 43: 425-430 (2013) - [j4]Saeid Alikhani
The Domination Polynomial of a Graph at -1. Graphs Comb. 29(5): 1175-1181 (2013) - 2011
- [j3]Saeid Alikhani
On the graphs with four distinct domination roots. Int. J. Comput. Math. 88(13): 2717-2720 (2011) - 2010
- [j2]Saieed Akbari
Characterization of graphs using domination polynomials. Eur. J. Comb. 31(7): 1714-1724 (2010)
2000 – 2009
- 2009
- [j1]Saeid Alikhani
Dominating Sets and Domination Polynomials of Paths. Int. J. Math. Math. Sci. 2009: 542040:1-542040:10 (2009)
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-09-10 01:14 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: