Saieed Akbari

Orcid: 0000-0001-8994-8858

Affiliations:
  • Sharif University of Technology, Tehran, Iran


According to our database1, Saieed Akbari authored at least 108 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tight bounds on the chromatic edge stability index of graphs.
Discret. Math., April, 2024

2023
On the chromatic edge stability index of graphs.
Eur. J. Comb., June, 2023

Vertex partitioning of graphs into odd induced subgraphs.
Discuss. Math. Graph Theory, 2023

Well-indumatched trees and graphs of bounded girth.
Australas. J Comb., 2023

2022
Independent domination in subcubic graphs.
J. Comb. Optim., 2022

Some Results on Dominating Induced Matchings.
Graphs Comb., 2022

On the chromatic vertex stability number of graphs.
Eur. J. Comb., 2022

Star chromatic number of some graphs.
Discret. Math. Algorithms Appl., 2022

2021
Induced path factors of regular graphs.
J. Graph Theory, 2021

Spectra of strongly Deza graphs.
Discret. Math., 2021

Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs.
Discret. Appl. Math., 2021

2020
Orientations of graphs avoiding given lists on out-degrees.
J. Graph Theory, 2020

Circular Zero-Sum r-Flows of Regular Graphs.
Graphs Comb., 2020

Nordhaus-Gaddum and other bounds for the chromatic edge-stability number.
Eur. J. Comb., 2020

Proof of a conjecture on the Seidel energy of graphs.
Eur. J. Comb., 2020

Signed complete graphs with maximum index.
Discuss. Math. Graph Theory, 2020

The coloring of the cozero-divisor graph of a commutative ring.
Discret. Math. Algorithms Appl., 2020

Zero-sum flows for Steiner systems.
Discret. Math., 2020

Some criteria for a signed graph to have full rank.
Discret. Math., 2020

On a question of Haemers regarding vectors in the nullspace of Seidel matrices.
CoRR, 2020

Balanced Equi-$n$-Squares.
Electron. J. Comb., 2020

2019
Highly edge-connected factors using given lists on degrees.
J. Graph Theory, 2019

Some results on the f-chromatic index of graphs whose f-core has maximum degree 2.
Australas. J Comb., 2019

2018
Equimatchable Regular Graphs.
J. Graph Theory, 2018

Cubic graphs with total domatic number at least two.
Discuss. Math. Graph Theory, 2018

On N2-vertex coloring of graphs.
Discret. Math. Algorithms Appl., 2018

Equimatchable claw-free graphs.
Discret. Math., 2018

2017
Complexity of the Improper Twin Edge Coloring of Graphs.
Graphs Comb., 2017

On double-star decomposition of graphs.
Discuss. Math. Graph Theory, 2017

Zero-sum flows for triple systems.
Discret. Math., 2017

Graphs with integer matching polynomial zeros.
Discret. Appl. Math., 2017

On the Structure of the Power Graph and the Enhanced Power Graph of a Group.
Electron. J. Comb., 2017

Fully Indecomposable and Nearly Decomposable Graphs.
Contributions Discret. Math., 2017

A Note on Co-Maximal Ideal Graph of Commutative Rings.
Ars Comb., 2017

On the structure of graphs having a unique k-factor.
Australas. J Comb., 2017

2016
Graphs with Integer Matching Polynomial Roots.
CoRR, 2016

Improper Twin Edge Coloring of Graphs.
CoRR, 2016

Hoffmann-Ostenhof's conjecture for traceable cubic graphs.
CoRR, 2016

0-Sum and 1-Sum Flows in Regular Graphs.
Electron. J. Comb., 2016

A Note on Roman Bondage Number of Graphs.
Ars Comb., 2016

Colorful Paths in Vertex Coloring of Graphs.
Ars Comb., 2016

On The Harmonious Colouring of Trees.
Ars Comb., 2016

A note on signed k-submatching in graphs.
Australas. J Comb., 2016

2015
An Algebraic Criterion for the Choosability of Graphs.
Graphs Comb., 2015

The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2.
Graphs Comb., 2015

Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges.
Eur. J. Comb., 2015

{0, 2}-Degree free spanning forests in graphs.
Discret. Math., 2015

Decompositions of graphs into trees, forests, and regular subgraphs.
Discret. Math., 2015

Even and Odd Cycles Passing a Given Edge or a Vertex.
CoRR, 2015

A Note on Edge Coloring of Graphs.
Ars Comb., 2015

Nowhere-zero Unoriented Flows in Hamiltonian Graphs.
Ars Comb., 2015

2014
{k, r - k}-Factors of r-Regular Graphs.
Graphs Comb., 2014

The Chromatic Index of a Graph Whose Core is a Cycle of Order at Most 13.
Graphs Comb., 2014

Graphs whose Spectrum Determined by Non-constant Coefficients.
Electron. Notes Discret. Math., 2014

On the inclusion ideal graph of a ring.
Electron. Notes Discret. Math., 2014

The Regular Graph of a Non-Commutative Ring.
Electron. Notes Discret. Math., 2014

Complete Multipartite Graphs and their Null Set.
Electron. Notes Discret. Math., 2014

A Generalization of Hadamard Matrices.
Electron. Notes Discret. Math., 2014

Proof of a theorem of Tutte using permanents.
Electron. Notes Discret. Math., 2014

Dominating Coloring Number of Claw-free Graphs.
Electron. Notes Discret. Math., 2014

On the Decision Number of Graphs.
CoRR, 2014

Zero-Sum Magic Labelings and Null Sets of Regular Graphs.
Electron. J. Comb., 2014

Cycles are determined by their domination polynomials.
Ars Comb., 2014

On the Dynamic Coloring of Cartesian Product Graphs.
Ars Comb., 2014

On the Dynamic Coloring of Strongly Regular Graphs.
Ars Comb., 2014

On D-equivalence class of complete bipartite graphs.
Ars Comb., 2014

Some bounds for the signed edge domination number of a graph.
Australas. J Comb., 2014

2013
The regular graph of a commutative ring.
Period. Math. Hung., 2013

A Note on the Roman Bondage Number of Planar Graphs.
Graphs Comb., 2013

On the Lucky Choice Number of Graphs.
Graphs Comb., 2013

On the edge cover polynomial of a graph.
Eur. J. Comb., 2013

Multicolored Spanning Subgraphs in G-Colorings of Complete Graphs.
Ars Comb., 2013

Characterization of M<sub>3</sub>(2)-graphs.
Ars Comb., 2013

CMOS implementation of a new high speed, glitch-free 5-2 compressor for fast arithmetic operations.
Proceedings of the 20th International Conference Mixed Design of Integrated Circuits and Systems, 2013

2012
Harmonious coloring of trees with large maximum degree.
Discret. Math., 2012

Some criteria for a graph to be Class 1.
Discret. Math., 2012

On the difference between chromatic number and dynamic chromatic number of graphs.
Discret. Math., 2012

On the coloring of the annihilating-ideal graph of a commutative ring.
Discret. Math., 2012

The Chromatic Index of a Graph Whose Core has Maximum Degree 2.
Electron. J. Comb., 2012

A Note on Zero-Sum 5-Flows in Regular Graphs.
Electron. J. Comb., 2012

On Harmonious Colouring of Trees.
Electron. J. Comb., 2012

2011
On edge star sets in trees.
Discret. Math., 2011

Colorful Paths in Vertex Coloring of Graphs.
Electron. J. Comb., 2011

2010
Zero-Sum Flows in Regular Graphs.
Graphs Comb., 2010

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

On Sum of Powers of the Laplacian and Signless Laplacian Eigenvalues of Graphs.
Electron. J. Comb., 2010

2009
A class of errorless codes for overloaded synchronous wireless and optical CDMA systems.
IEEE Trans. Inf. Theory, 2009

Commutativity of the adjacency matrices of graphs.
Discret. Math., 2009

Some relations between rank, chromatic number and energy of graphs.
Discret. Math., 2009

List coloring of graphs having cycles of length divisible by a given number.
Discret. Math., 2009

On the signed edge domination number of graphs.
Discret. Math., 2009

On the list dynamic coloring of graphs.
Discret. Appl. Math., 2009

On the size of graphs whose cycles have length divisible by a fixed integer.
Australas. J Comb., 2009

2008
A Class of Errorless Codes for Over-loaded Synchronous Wireless and Optical CDMA Systems and Evaluation of Channel Capacity Bounds
CoRR, 2008

A short proof for a theorem of Tutte.
Australas. J Comb., 2008

Errorless codes for over-loaded synchronous CDMA systems and evaluation of channel capacity bounds.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Multicolored trees in complete graphs.
J. Graph Theory, 2007

On rainbow cycles in edge colored complete graphs.
Australas. J Comb., 2007

2006
Multicolored Parallelisms of Isomorphic Spanning Trees.
SIAM J. Discret. Math., 2006

A relation between choosability and uniquely list colorability.
J. Comb. Theory, Ser. B, 2006

Some relations among term rank, clique number and list chromatic number of a graph.
Discret. Math., 2006

Transversals in long rectangular arrays.
Discret. Math., 2006

r-Strong edge colorings of graphs.
Discret. Math., 2006

2003
Two conjectures on uniquely totally colorable graphs.
Discret. Math., 2003

2002
On the smallest edge defining sets of graphs.
Ars Comb., 2002

2001
K<sub>r</sub>-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges.
J. Comb. Theory, Ser. B, 2001

Minimal defining sets for full 2-(v, 3, v-2) designs.
Australas. J Comb., 2001

1997
Uniquely Total Colorable Graphs.
Graphs Comb., 1997


  Loading...