Rainbow vertex-connection number on a small-world Farey graph

Darayon, Chayapa; Tangjai, Wipawee

doi:10.1080/09728600.2022.2057827

Search citation statements

Order By: Relevance

Paper Sections

Select...

Results3

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article2

Book1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Next, we compute the δ -chromatic number of a small-world Farey graph which is characterized as a small-world network graph. We use the definition of a small-world Farey graph

as appeared in [8] , [9] . The small-world Farey graph is a recursively constructed graph with

0

as an initial graph.…”

Section: Resultsmentioning

confidence: 99%

“…We say that the level of

is k if u is first appeared in step k . The labels of the vertices in

appeared in [9] is also recursively constructed. The initial labeling is that the labels of the vertices in

0

are

and

.…”

Section: Resultsmentioning

confidence: 99%

“…We color the vertices in

with

colors. By using the label appearing in [9] as mentioned above, we are able to partition each

into

and

for

2

. For

12

, let

and

be such that

for

12

.…”

Section: Resultsmentioning

confidence: 99%

See 2 more Smart Citations

On Nordhaus-Gaddum type relations of δ-complement graphs

Vichitkunakorn

Maungchang

Tangjai

2023

Heliyon

Self Cite

View full text Add to dashboard Cite

“…Next, we compute the δ -chromatic number of a small-world Farey graph which is characterized as a small-world network graph. We use the definition of a small-world Farey graph

as appeared in [8] , [9] . The small-world Farey graph is a recursively constructed graph with

0

as an initial graph.…”

Section: Resultsmentioning

confidence: 99%

“…We say that the level of

is k if u is first appeared in step k . The labels of the vertices in

appeared in [9] is also recursively constructed. The initial labeling is that the labels of the vertices in

0

are

and

.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

On Nordhaus-Gaddum type relations of δ-complement graphs

Vichitkunakorn

Maungchang

Tangjai

2023

Heliyon

Self Cite

View full text Add to dashboard Cite

“…Rainbow connectivity finds significant applications in network security, attracting the attention of numerous scholars and yielding substantial results for both general graphs and digraphs. Furthermore recently some new results ( [11] , [10] , [12] ) which are concerning the rainbow connectivity in some random graph models are obtained.…”

Section: Introductionmentioning

confidence: 99%