Rafayel R. Kamalian

activity

20102014

most citedOn one-sided interval edge colorings of biregular bipartite graphs

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing cs.DMShow all

6 papers · 1 filter

cs.DM2014

A necessary and sufficient condition for a graph $G$ , which satisfies the equality $μ_{21} (G) = ∣ V (G) ∣$

Narine N. Davtyan, Rafayel R. Kamalian

A necessary and sufficient condition is found for a graph $G$ , which satisfies the equality $μ_{21} (G) = ∣ V (G) ∣$ .

cs.DM2014

A Description of the Subgraph Induced at a Labeling of a Graph by the Subset of Vertices with an Interval Spectrum

Narine N. Davtyan, Arpine M. Khachatryan, Rafayel R. Kamalian

The sets of vertices and edges of an undirected, simple, finite, connected graph $G$ are denoted by $V (G)$ and $E (G)$ , respectively. An arbitrary nonempty finite subset of consecut…

cs.DM2012★ 1 cited

On one-sided interval edge colorings of biregular bipartite graphs

R. R. Kamalian

A proper edge $t$ -coloring of a graph $G$ is a coloring of edges of $G$ with colors $1, 2, ..., t$ such that all colors are used, and no two adjacent edges receive the same color. The…

cs.DM2012

It was not known about simple cycles

R. R. Kamalian

A proper edge $t$ -coloring of a graph is a coloring of its edges with colors $1, 2, ..., t$ such that all colors are used, and no two adjacent edges receive the same color. For any in…

cs.DM2012

On the parameter $μ_{21}$ of a complete bipartite graph

A. M. Khachatryan, R. R. Kamalian

A proper edge $t$ -coloring of a graph $G$ is a coloring of edges of $G$ with colors $1, 2, ..., t$ such that all colors are used, and no two adjacent edges receive the same color. The…

cs.DM2010

A note on interval edge-colorings of graphs

R. R. Kamalian, P. A. Petrosyan

An edge-coloring of a graph $G$ with colors $1, 2, \dots, t$ is called an interval $t$ -coloring if for each $i \in {1, 2, \dots, t}$ there is at least one edge of $G$ colored by $i$ ,…