Gholam Hossein Fath-Tabar

Prof. Gholam Hossein Fath-Tabar


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 August 2009 in Journal of Mathematical Chemistry
Verified
Journal Article
Closed access
PDF file
GFGholam Hossein Fath-Tabar
Gholam Hossein Fath-Tabar
Boris FurtulaBoris Furtula
Boris Furtula
Ivan GutmanIvan Gutman
Ivan Gutman

1 August 2011 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
GFGholam Hossein Fath-Tabar
Gholam Hossein Fath-Tabar
BVB. Vaez-Zadeh
B. Vaez-Zadeh
AAAli Reza Ashrafi
Ali Reza Ashrafi
AGA. Graovac
A. Graovac

1 October 2012 in Applied Mathematics Letters
Verified
Journal Article
Closed access
MFM. Adabitabar Firozja
M. Adabitabar Firozja
GFGholam Hossein Fath-Tabar
Gholam Hossein Fath-Tabar
ZEZ. Eslampia
Z. Eslampia

1 December 2009 in Applied Mathematics Letters
Verified
Journal Article
Closed access
JNJavad Nadjafi-Arani
Javad Nadjafi-Arani
GFGholam Hossein Fath-Tabar
Gholam Hossein Fath-Tabar
AAAli Reza Ashrafi
Ali Reza Ashrafi

1 January 2017 in Filomat
Verified
Journal Article
Open access
PDF file
EGE. Ghasemian
E. Ghasemian
GFGholam Hossein Fath-Tabar
Gholam Hossein Fath-Tabar
Let G? be a signed graph with the underlying graph G and with sign function ? : E(G) ? {?}. In this paper, we characterize the signed graphs with two distinct eigenvalues whose underlying graphs are triangle-free. Also, we classify all 3-regular and 4-regular signed graphs whose underlying graphs are triangle-free and give their adjacency matrices as well.

7 July 2018 in AKCE International Journal of Graphs and Combinatorics
Verified
Journal Article
Open access
PDF file
AAAli Zeydi Abdian
Ali Zeydi Abdian
ABAfshin Behmaram
Afshin Behmaram
GFGholam Hossein Fath-Tabar
Gholam Hossein Fath-Tabar
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An important part of spectral graph theory is devoted to determining whether given graphs or classes of graphs are determined by their spectra or not. So, finding and introducing any class of graphs which are determined by their spectra can be an interesting and important problem. A graph is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a DQS graph G, we show that G∪rK1∪sK2 is DQS under certain conditions, where r, s are natural numbers and K1 andK2 denote the complete graphs on one vertex and two vertices, respectively. Applying these results, some DQS graphs with independent edges and isolated vertices are obtained.