Gholam Hossein Fath-Tabar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gholam Hossein Fath-Tabar has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Ali Reza Ashrafi
University of Kashan, Kashan, Iran
6 shared publications Mehrnoosh Javarsineh
Univ Kashan, Fac Math Sci, Dept Pure Math, Kashan 8731751167, Iran
3 shared publications- Ahmad Gholami
Qom University, Qom, Iran
2 shared publications F. Taghvaee
University of Kashan
2 shared publications- Ramin Nasiri
Imam Hossein Comprehensive University
2 shared publications A. Graovac
The Rugjer Boskovic Institute, NMR Center, HR-10002 Zagreb, P.O. Box 180, Croatia
1 shared publication
Latest Publications
- Open Access
- 26 August 2024
- Published by Springer Nature in Order
- Vol. 42 (1) , 241-250
Forbidden Subposets in the Cycle Poset
The cycle poset consists of the intervals of the cyclic permutation of the elements 1, 2, ..., n, ordered by inclusion. Suppose that F is a set of such intervals, none of them is a less than s others. The maximum size of F is determined under this condition. It is also shown that if the largest size of a set in this poset without containing a small subposet P is known, it solves the same problem, up to an additive constant, in the grid poset consisting of the pairs $$(i,j) (1\le i,j\le n)$$ and ordered coordinate-wise.- 26 August 2024
- Published by Springer Nature in Order
- Vol. 42 (1) , 241-250
Open AccessForbidden Subposets in the Cycle Poset
The cycle poset consists of the intervals of the cyclic permutation of the elements 1, 2, ..., n, ordered by inclusion. Suppose that F is a set of such intervals, none of them is a less than s others. The maximum size of F is determined under this condition. It is also shown that if the largest size of a set in this poset without containing a small subposet P is known, it solves the same problem, up to an additive constant, in the grid poset consisting of the pairs $$(i,j) (1\le i,j\le n)$$ and ordered coordinate-wise. - 1 July 2023
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 90 (3) , 787-798
Estrada and L-Estrada Indices of a Graph and Their Relationship with the Number of Spanning Trees
- 1 July 2023
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 90 (3) , 787-798
Estrada and L-Estrada Indices of a Graph and Their Relationship with the Number of Spanning Trees
- 28 May 2020
- Published by University of Nis in Facta Universitatis, Series: Mathematics and Informatics
- Vol. 35 (2) , 533-540
NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and let A be the adjacency matrix and Q be the Laplacianmatrix of G. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been applied to several elds, such as randomized algorithms, combinatorial optimization problems and machine learning. In this paper, we compute lower and upper bounds for the largest Laplacian eigenvalue which is related with a given maximum and minimum degree and a given number of vertices and edges. We also compare our results in this paper with some known results.
- 28 May 2020
- Published by University of Nis in Facta Universitatis, Series: Mathematics and Informatics
- Vol. 35 (2) , 533-540
NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and let A be the adjacency matrix and Q be the Laplacianmatrix of G. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been applied to several elds, such as randomized algorithms, combinatorial optimization problems and machine learning. In this paper, we compute lower and upper bounds for the largest Laplacian eigenvalue which is related with a given maximum and minimum degree and a given number of vertices and edges. We also compare our results in this paper with some known results.
- Open Access
- 1 September 2018
- Vol. 6 (1) , 13-28
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
- 1 September 2018
- Vol. 6 (1) , 13-28
Open AccessSIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
- Open Access
- 7 July 2018
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 17 (1) , 45-50
Graphs determined by signless Laplacian spectra
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 if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a graph , we show that is under certain conditions, where , are natural numbers and and denote the complete graphs on one vertex and two vertices, respectively. Applying these results, some graphs with independent edges and isolated vertices are obtained.- 7 July 2018
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 17 (1) , 45-50
Open AccessGraphs determined by signless Laplacian spectra
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 if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a graph , we show that is under certain conditions, where , are natural numbers and and denote the complete graphs on one vertex and two vertices, respectively. Applying these results, some graphs with independent edges and isolated vertices are obtained. - Open Access
- 3 April 2018
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 6 (1) , 190-200
On maximum signless Laplacian Estrada index of graphs with given parameters II
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of G. Following the previous work in which we have identified the unique graphs with maximum signless Laplacian Estrada index with each of the given parameters, namely, number of cut edges, pendent vertices, (vertex) connectivity, and edge connectivity, in this paper we continue our characterization for two further parameters: diameter and number of cut vertices.- 3 April 2018
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 6 (1) , 190-200
Open AccessOn maximum signless Laplacian Estrada index of graphs with given parameters II
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of G. Following the previous work in which we have identified the unique graphs with maximum signless Laplacian Estrada index with each of the given parameters, namely, number of cut edges, pendent vertices, (vertex) connectivity, and edge connectivity, in this paper we continue our characterization for two further parameters: diameter and number of cut vertices. - 1 December 2017
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 315, 603-614
Unicyclic and bicyclic graphs with exactly three Q -main eigenvalues
- 1 December 2017
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 315, 603-614
Unicyclic and bicyclic graphs with exactly three Q -main eigenvalues
- 1 August 2017
- Published by Armenian Green Publishing Co. in Algebraic structures and their applications
- Vol. 4 (1) , 19-32
The Main Eigenvalues of the Undirected Power Graph of a Group
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one vector. In this paper we want to focus on the power graph of the finite cyclic group $mathbb{Z}_{n}$ and find a condition on n where $P(mathbb{Z}_{n})$ has exactly one main eigenvalue. Then we calculate the number of main eigenvalues of $P(mathbb{Z}_{n})$ where $n$ has a unique prime decomposition $n = p^{r} p_2$. We also formulate a conjecture on the number of the main eigenvalues of $P(mathbb{Z}_{n})$ for an arbitrary positive integer $n$.- 1 August 2017
- Published by Armenian Green Publishing Co. in Algebraic structures and their applications
- Vol. 4 (1) , 19-32
The Main Eigenvalues of the Undirected Power Graph of a Group
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one vector. In this paper we want to focus on the power graph of the finite cyclic group $mathbb{Z}_{n}$ and find a condition on n where $P(mathbb{Z}_{n})$ has exactly one main eigenvalue. Then we calculate the number of main eigenvalues of $P(mathbb{Z}_{n})$ where $n$ has a unique prime decomposition $n = p^{r} p_2$. We also formulate a conjecture on the number of the main eigenvalues of $P(mathbb{Z}_{n})$ for an arbitrary positive integer $n$.- 1 March 2017
- Vol. 6 (1) , 47-54
On the skew spectral moments of graphs
- Open Access
- 1 March 2017
- Vol. 8 (1) , 7-23
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
- 1 March 2017
- Vol. 8 (1) , 7-23
Open AccessRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications