Shahrooz Janbaz

activity

20132016

most citedGraphs cospectral with a friendship graph or its complement

3 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

quant-ph2016

An Adiabatic Quantum Algorithm for Determining Gracefulness of A Graph

Sayed Mohammad Hosseini, Mahdi Davoudi Darareh, Shahrooz Janbaz +1

Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \cd…

math.CO2015

Groups all of whose undirected Cayley graphs are determined by their spectra

Alireza Abdollahi, Shahrooz Janbaz, Mojtaba Jazaeri

Let $G$ be a finite group, and $S$ be a subset of $G ∖ {1}$ such that $S = S^{- 1}$ . Suppose that $C a y (G, S)$ is the Cayley graph on $G$ with respect to the set $S$ which is th…

math.CO2014

Connected graphs cospectral with a Friendship graph

Alireza Abdollahi, Shahrooz Janbaz

Let $n$ be any positive integer, the friendship graph $F_{n}$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a g…

math.CO2013★ 3 cited

Graphs cospectral with a friendship graph or its complement

Alireza Abdollahi, Shahrooz Janbaz, Mohammad Reza Oboudi

Let $n$ be any positive integer and let $F_{n}$ be the friendship (or Dutch windmill) graph with $2 n + 1$ vertices and $3 n$ edges. Here we study graphs with the same adjacency spectrum…