| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 894 0 |
 SM ISO690:2012KAMALIAN, Rafayel. On cyclically-interval edge colorings of trees. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2012, nr. 1(68), pp. 50-58. ISSN 1024-7696. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica |
||||||
| Numărul 1(68) / 2012 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
| Pag. 50-58 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
For an undirected, simple, finite, connected graph G, we denote by V (G)
and E(G) the sets of its vertices and edges, respectively. A function ' : E(G) →
{1, 2, . . . , t} is called a proper edge t-coloring of a graph G if adjacent edges are
colored differently and each of t colors is used. An arbitrary nonempty subset of
consecutive integers is called an interval. If ' is a proper edge t-coloring of a graph
G and x ∈ V (G), then SG(x, ') denotes the set of colors of edges of G which are
incident with x. A proper edge t-coloring ' of a graph G is called a cyclically-interval
t-coloring if for any x ∈ V (G) at least one of the following two conditions holds: a)
SG(x,') is an interval, b) {1, 2, . . . , t} \ SG(x, ') is an interval. For any t ∈ N, let
Mt be the set of graphs for which there exists a cyclically-interval t-coloring, and let
M ≡St≥1 Mt. For an arbitrary tree G, it is proved that G ∈ M and all possible
values of t are found for which G ∈ Mt. |
||||||
| Cuvinte-cheie Tree, interval edge coloring, cyclically-interval edge coloring. |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-17758</cfResPublId>
<cfResPublDate>2012-04-03</cfResPublDate>
<cfVol>68</cfVol>
<cfIssue>1</cfIssue>
<cfStartPage>50</cfStartPage>
<cfISSN>1024-7696</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/17758</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>On cyclically-interval edge colorings of trees</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>Tree; interval edge coloring; cyclically-interval edge
coloring.</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'>For an undirected, simple, finite, connected graph G, we denote by V (G)
and E(G) the sets of its vertices and edges, respectively. A function ' : E(G) →
{1, 2, . . . , t} is called a proper edge t-coloring of a graph G if adjacent edges are
colored differently and each of t colors is used. An arbitrary nonempty subset of
consecutive integers is called an interval. If ' is a proper edge t-coloring of a graph
G and x ∈ V (G), then SG(x, ') denotes the set of colors of edges of G which are
incident with x. A proper edge t-coloring ' of a graph G is called a cyclically-interval
t-coloring if for any x ∈ V (G) at least one of the following two conditions holds: a)
SG(x,') is an interval, b) {1, 2, . . . , t} \ SG(x, ') is an interval. For any t ∈ N, let
Mt be the set of graphs for which there exists a cyclically-interval t-coloring, and let
M ≡St≥1 Mt. For an arbitrary tree G, it is proved that G ∈ M and all possible
values of t are found for which G ∈ Mt.</cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2012-04-03T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2012-04-03T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-33604</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2012-04-03T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-33604</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-33604-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2012-04-03T24:00:00</cfStartDate>
<cfFamilyNames>Kamalian</cfFamilyNames>
<cfFirstNames>Rafayel</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>|
|
|
