78 citations
- Yerevan State UniversityAM12 papers
- Joint Institute for Nuclear ResearchRU5 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR2 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT2 papers
- Laboratoire de Physique des 2 Infinis Irène Joliot-CurieFR2 papers
- National Academy of Sciences of ArmeniaAM2 papers
- National Research Tomsk State UniversityRU2 papers
- Russian-Armenian UniversityAM2 papers
- Tomsk Polytechnic UniversityRU2 papers
- Université Paris-SaclayFR2 papers
- A. Alikhanyan National LaboratoryAM1 paper
8 papers · 1 filter
Separation and Electrical Properties of Self-Organized Graphene/Graphite Layers
Manuel R. Mailian, Aram R. Mailian
Intrinsic layered structure of graphite is the source of ongoing and expanding search of ways of obtaining low-cost and promising graphite thin layers. We report on a novel method…
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…
Transfer matrix for spanning trees, webs and colored forests
J. G. Brankov, V. S. Poghosyan, V. B. Priezzhev +1
We use the transfer matrix formalism for dimers proposed by Lieb, and generalize it to address the corresponding problem for arrow configurations (or trees) associated to dimer con…
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…