Saeid Alikhani

Orcid: 0000-0002-1801-203X

According to our database1, Saeid Alikhani authored at least 34 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Connected coalitions in graphs.
Discuss. Math. Graph Theory, 2024

Counting the Number of Domatic Partition of a Graph.
CoRR, 2024

2023
On the edge chromatic vertex stability number of graphs.
AKCE Int. J. Graphs Comb., January, 2023

2022
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring.
Art Discret. Appl. Math., December, 2022

Total dominator chromatic number of k-subdivision of graphs.
Art Discret. Appl. Math., November, 2022

More on the unimodality of domination polynomial of a graph.
Discret. Math. Algorithms Appl., 2022

2021
‎Distinguishing index of Kronecker product of two graphs.
Electron. J. Graph Theory Appl., 2021

On the independent domination polynomial of a graph.
Discret. Appl. Math., 2021

Sequence pairs related to produced graphs from a method for dividing a natural number by two.
CoRR, 2021

Mostar index and edge Mostar index of polymers.
Comput. Appl. Math., 2021

2020
Trees with distinguishing index equal distinguishing number plus one.
Discuss. Math. Graph Theory, 2020

Graphs and codes produced by a new method for dividing a natural number by two.
CoRR, 2020

The chromatic distinguishing index of certain graphs.
AKCE Int. J. Graphs Comb., 2020

The distinguishing number and the distinguishing index of line and graphoidal graph(s).
AKCE Int. J. Graphs Comb., 2020

On the spectral determinations of the connected multicone graphs.
AKCE Int. J. Graphs Comb., 2020

2019
Symmetry breaking in planar and maximal outerplanar graphs.
Discret. Math. Algorithms Appl., 2019

Distinguishing number and distinguishing index of neighbourhood corona of two graphs.
Contributions Discret. Math., 2019

Trees with distinguishing number two.
AKCE Int. J. Graphs Comb., 2019

On k-total dominating graphs.
Australas. J Comb., 2019

2018
Computation of Gutman index of some cactus chains.
Electron. J. Graph Theory Appl., 2018

Some families of graphs with no nonzero real domination roots.
Electron. J. Graph Theory Appl., 2018

The distinguishing number and distinguishing index of the lexicographic product of two graphs.
Discuss. Math. Graph Theory, 2018

2017
On the Structure of Dominating Graphs.
Graphs Comb., 2017

More on domination polynomial and domination root.
Ars Comb., 2017

2016
The Distinguishing Number of Kronecker Product of Two Graphs.
Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

2015
Randić energy of specific graphs.
Appl. Math. Comput., 2015

On k-edge-magic labelings of maximal outerplanar graphs.
AKCE Int. J. Graphs Comb., 2015

2014
On the k-edge magic graphs.
Electron. Notes Discret. Math., 2014

Introduction to Domination Polynomial of a Graph.
Ars Comb., 2014

2013
The Domination Polynomial of a Graph at -1.
Graphs Comb., 2013

Some new results on domination roots of a graph.
Electron. Notes Discret. Math., 2013

2011
On the graphs with four distinct domination roots.
Int. J. Comput. Math., 2011

2010
Characterization of graphs using domination polynomials.
Eur. J. Comb., 2010

2009
Dominating Sets and Domination Polynomials of Paths.
Int. J. Math. Math. Sci., 2009


  Loading...