78 citations
- Yerevan State UniversityAM19 papers
- Joint Institute for Nuclear ResearchRU5 papers
- National Academy of Sciences of ArmeniaAM4 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR2 papers
- Laboratoire de Physique des 2 Infinis Irène Joliot-CurieFR2 papers
- National Research Tomsk State UniversityRU2 papers
- Russian-Armenian UniversityAM2 papers
- Tomsk Polytechnic UniversityRU2 papers
- Université Paris-SaclayFR2 papers
- A. Alikhanyan National LaboratoryAM1 paper
6 papers · 2 filters
Interval Total Colorings of Complete Multipartite Graphs and Hypercubes
Petros A. Petrosyan, Nerses A. Khachatryan
A total coloring of a graph is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An interval…
On some Versions of Conjectures of Bondy and Jung
Zh. G. Nikoghosyan
Using algebraic transformations and equivalent reformulations we derive a number of new results from some earlier ones (by the author) in more accepted terms closely related to wel…
On Hamiltonian Bypasses in Digraphs with the Condition of Y. Manoussakis
Samvel Kh. Darbinyan
Let be a strongly connected directed graph of order vertices which satisfies the following condition for every triple of vertices such that and are no…
On pre-Hamiltonian Cycles in Hamiltonian Digraphs
Samvel Kh. Darbinyan
Let be a strongly connected directed graph of order . In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Supp…
On Cycles through Vertices of Large Semidegree in Digraphs
S. Kh. Darbinyan, I. A. Karapetyan
Let be a strong digraph on vertices. In this paper we show that if contains a cycle of length , then has also a cycle which contains all vertices wi…
On Hamiltonian Bypasses in one Class of Hamiltonian Digraphs
Samvel Kh. Darbinyan, Iskandar A. Karapetyan
Let be a strongly connected directed graph of order which satisfies the following condition (*): for every pair of non-adjacent vertices with a common in-neigh…