Results 101 to 110 of about 5,748 (282)

On the rainbow connection numbers of line, middle, and total graphs of wheels

open access: yesElectronic Journal of Graph Theory and Applications
An edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow ...
Lyra Yulianti   +2 more
doaj   +1 more source

Rainbow Total-Coloring of Complementary Graphs and Erdős-Gallai Type Problem For The Rainbow Total-Connection Number

open access: yesDiscussiones Mathematicae Graph Theory, 2018
A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj   +1 more source

More on the Minimum Size of Graphs with Given Rainbow Index

open access: yesDiscussiones Mathematicae Graph Theory, 2020
The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand et al., is a natural generalization of the rainbow connection number of a graph.
Zhao Yan
doaj   +1 more source

ANALISIS RAINBOW VERTEX CONNECTION PADA BEBERAPA GRAF KHUSUS DAN OPERASINYA

open access: yes, 2016
Salah satu teori yang dikembangkan dalam teori graf adalah rainbow connection. Teori rainbow connection dikembangkan menjadi 2 jenis yaitu rain- bow edge connection yang biasa disebut rainbow connection dan rainbow vertex connection.
ARISKA, Ida
core   +1 more source

Haunting the Historiography of Slaves in South Asia from the nineteenth century to the present

open access: yesGender &History, EarlyView.
ABSTRACT Using both English and Urdu‐language records, this article traces the career of a few African and Afro‐Asian women slaves in the household‐state of Awadh during the first half of the nineteenth century. Focusing on the same records, this article compares a master‐poet's recognition of the motherhood of the African and Afro‐Asian slaves to the ...
Indrani Chatterjee
wiley   +1 more source

REPRESENTING POLLUTION AT THE AGRARIAN–URBAN FRONTIER: Participatory Documentary Film‐Making in Bar Elias, Lebanon

open access: yesInternational Journal of Urban and Regional Research, EarlyView.
Abstract The Beqaa Valley in Lebanon has become increasingly polluted, and residents are attributing illness to improper waste disposal and dumping. This article explores local epistemologies of pollution’s causes and effects in three films, which were researched and produced by local residents of Bar Elias, a small town in the Beqaa, which has rapidly
Hannah Sender   +2 more
wiley   +1 more source

On the rainbow connection of Cartesian products and their subgraphs

open access: yes, 2012
Rainbow connection number of Cartesian products and their subgraphs are considered. Previously known bounds are compared and non-existence of such bounds for subgraphs of products are discussed.
Klavžar, Sandi, Mekiš, Gašper
core   +1 more source

Rainbow connection and minimum degree

open access: yesDiscrete Applied Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Visual Voices, an Interpretive Methodology: Advocating for Inclusion in Cancer Research for People With Intellectual Disabilities Through Artwork Analysis

open access: yesBritish Journal of Learning Disabilities, EarlyView.
ABSTRACT Background People with intellectual disabilities face inequities across the cancer care continuum. Barriers in communication and healthcare accessibility contribute to late‐stage cancer diagnoses and poorer outcomes. People with intellectual disabilities are often excluded from cancer research. This study presents a researcher‐led interpretive
Claire Zhou   +8 more
wiley   +1 more source

Rainbow Connection of Random Regular Graphs

open access: yes, 2013
An edge colored graph G is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to ...
Andrzej Dudek   +2 more
core  

Home - About - Disclaimer - Privacy