20 citations · 62 across the 5 of their papers we have counts for
5 papers
On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs
Davit Aslanyan, Vahan V. Mkrtchyan, Samvel S. Petrosyan +1
We show that any factor of a cubic graph can be extended to a maximum edge-colorable subgraph. We also show that the sum of sizes of maximum and edge-colorable sub…
On disjoint matchings in cubic graphs
Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan
For and a cubic graph let denote the maximum number of edges that can be covered by matchings. We show that and $ν_{3}(G)\ge…
5-cycles and the Petersen graph
Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan
We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph.
Measurement of gamma-gamma and gamma-electron luminosities at photon colliders
A. V. Pak, D. V. Pavluchenko, S. S. Petrosyan +2
Methods of gamma-gamma, gamma-electron luminosities measurement at photon colliders based on Compton scattering of laser photons on high energy electrons at linear colliders are co…
Nuclear Structure Corrections to Deuterium Hyperfine Structure and Lamb Shift
I. B. Khriplovich, A. I. Milstein, S. S. Petrosyan
The low-energy theorem for the forward Compton scattering is generalized to the case of an arbitrary target spin. The generalization is used to calculate the corresponding contribu…