Search

Your search keyword '"Petrosyan, Samvel S."' showing total 3 results
Start Over Author "Petrosyan, Samvel S." Database Academic Search Index
3 results on '"Petrosyan, Samvel S."'

1. On disjoint matchings in cubic graphs

Author

Mkrtchyan, Vahan V., Petrosyan, Samvel S., and Vardanyan, Gagik N.

Subjects
*MATCHING theory, *GRAPH theory, *PATHS & cycles in graph theory, *COMBINATORICS, *MATHEMATICAL analysis
Abstract

Abstract: For and a cubic graph let denote the maximum number of edges that can be covered by matchings. We show that and . Moreover, it turns out that . [Copyright &y& Elsevier]

Published
2010
Full Text
View/download PDF

3. On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs.

Author

Aslanyan, Davit, Mkrtchyan, Vahan V., Petrosyan, Samvel S., and Vardanyan, Gagik N.

Subjects
*MATCHING theory, *GRAPH theory, *CUBES, *GRAPH coloring, *SUBGRAPHS, *MATHEMATICAL bounds
Abstract

Abstract: We show that any 2-factor of a cubic graph can be extended to a maximum 3-edge-colorable subgraph. We also show that the sum of sizes of maximum 2- and 3-edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices. Finally, for a cubic graph , consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let be the largest matching among such pairs. Let be a maximum matching of . We show that is a tight upper bound for . [Copyright &y& Elsevier]

Published
2014
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results