1 citations · 1 across the 5 of their papers we have counts for
5 papers
A necessary and sufficient condition for a graph , which satisfies the equality
Narine N. Davtyan, Rafayel R. Kamalian
A necessary and sufficient condition is found for a graph , which satisfies the equality .
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 are denoted by and , respectively. An arbitrary nonempty finite subset of consecut…
Some remarks on relations between the -parameters of regular graphs
N. N. Davtyan, R. R. Kamalian
For an undirected, simple, finite, connected graph , we denote by and the sets of its vertices and edges, respectively. A function …
On the -parameters of the Petersen graph
N. N. Davtyan
For an undirected, simple, finite, connected graph , we denote by and the sets of its vertices and edges, respectively. A function …
An inequality for the number of vertices with an interval spectrum in edge labelings of regular graphs
N. N. Davtyan, R. R. Kamalian
We consider undirected simple finite graphs. The sets of vertices and edges of a graph are denoted by and , respectively. For a graph , we denote by and…