424 citations
- Institute for Research in Fundamental SciencesIR51 papers
- University of TehranIR16 papers
- Institute of Nuclear Physics, Polish Academy of SciencesPL12 papers
- Jagiellonian UniversityPL12 papers
- University of GroningenNL12 papers
- University of KashanIR12 papers
- University of Silesia in KatowicePL12 papers
- Semnan UniversityIR10 papers
- Persian Gulf UniversityIR9 papers
- Graduate University of Advanced TechnologyIR8 papers
- Vilnius UniversityLT8 papers
- University of Science and Technology of MazandaranIR7 papers
28 papers · 1 filter
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
Saeid Alikhani, Mohammad Hadi Shekarriz
A coloring is distinguishing (or symmetry breaking) if no non-identity automorphism preserves it. The distinguishing threshold of a graph , denoted by , is the minimum num…
Ground state heavy tetraquark production in heavy quark fragmentation
S. Mohammad Moosavi Nejad, Nahid Amiri
During recent years, the study of exotic hadrons including tetraquarks and pentaquarks has attracted a lot of interests and more studies are in progress experimentally and theoreti…
Analytical perturbation theory and Nucleon structure function in infrared region
L. Ghasemzadeh, A. Mirjalili, S. Atashbar Tehrani
We employ analytic QCD (anQCD) approach to analyze the unpolarized nucleon structure function (NSF) in deep inelastic scattering ( DIS ) processes at the next-to-leading order (NLO…
Impacts of EMC effects on the D meson modification factor in equilibrating QGP
A. Mirjalili, J. Sheibani, K. Javidan +2
In this article we employ the nuclear EMC effect to extract the parton distribution functions (PDFs) inside the Lead (Pb) and Gold (Au) nuclei. Extracted PDFs are utilized to obtai…
Distinguishing threshold for some graph operations
Mohammad Hadi Shekarriz, Seyed Alireza Talebpour Shirazi Fard, Bahman Ahmadi +2
A vertex coloring of a graph is distinguishing if non-identity automorphisms do not preserve it. The distinguishing number, , is the minimum number of colors required for…
The number of distinguishing colorings of a Cartesian product graph
Saeid Alikhani, Mohammad Hadi Shekarriz
A vertex coloring is called distinguishing if the identity is the only automorphism that can preserve it. The distinguishing threshold of a graph is the minimum number o…