Shahid Beheshti University

output

20022013

most citedNew asymptotically flat phantom wormhole solutions

125 citations

researchers with a paper here

H. R. Sepangi33 · h 26
S. Jalalzadeh2 profiles21 · h 21
S. S. Gousheh13 · h 15
N. Khosravi9 · h 20
B. Vakili8 · h 20
K. Atazadeh2 profiles8 · h 19
M. Heydari-Fard2 profiles8 · h 13
M. Movahed8 · h 16
Pouria Pedram2 profiles7 · h 7
M. Tousi2 profiles6 · h 11
H. Hajiabolhassan5 · h 14
H. Salehi5 · h 20

collaborating institutions

Institute for Research in Fundamental SciencesIR15 papers
Sharif University of TechnologyIR6 papers
Alzahra UniversityIR5 papers
Institute for Cognitive Science StudiesIR4 papers
University of QomIR4 papers
Centre National de la Recherche ScientifiqueFR3 papers
Hebrew University of JerusalemIL3 papers
Islamic Azad University of ChalousIR3 papers
Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT3 papers
Istituto Nazionale di Fisica Nucleare, Sezione di BariIT3 papers
Istituto Nazionale di Fisica Nucleare, Sezione di PaviaIT3 papers
Istituto Nazionale di Fisica Nucleare, Sezione di TorinoIT3 papers

Showing 2009 · math.COShow all

3 papers · 2 filters

math.CO2009★ 5 cited

On Dynamic Coloring of Graphs

Meysam Alishahi

A dynamic coloring of a graph $G$ is a proper coloring such that for every vertex $v \in V (G)$ of degree at least 2, the neighbors of $v$ receive at least 2 colors. In this paper we…

math.CO2009★ 2 cited

On the b-chromatic number of Kneser Graphs

Hossein Hajiabolhassan

In this note, we prove that for any integer $n \geq 3$ the b-chromatic number of the Kneser graph $K G (m, n)$ is greater than or equal to $2 (n ⌊ \frac{m}{2} ⌋)$ . Th…

math.CO2009

Circular Coloring and Mycielski Construction

Meysam Alishahi, Hossein Hajiabolhassan

In this paper, we investigate circular chromatic number of Mycielski construction of graphs. It was shown in \cite{MR2279672} that $t^{th}$ Mycielskian of the Kneser graph $KG(…