Results 81 to 90 of about 289,295 (264)
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, EarlyView.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth.
Marc Distel
wiley +1 more source
Note on the upper bound of the rainbow index of a graph [PDF]
, 2014 A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the minimum number of ...
Cai, Qingqiong, Li, Xueliang, Zhao, Yan
core
The rainbow connection number of graph resulting for operation of sun graph and path graph
, 2020 Let G is a connected graph. A rainbow k-coloring on G is a function c : E(G) → {1, …, k for k ∈ ℕ where for any two vertices u and v in V, there is a path which all edges have no same color.
N. M. Surbakti, D. R. Silaban, K. Sugeng
semanticscholar +1 more source
Journal of Organizational Behavior, EarlyView.ABSTRACT As organizations increasingly adopt human‐AI teams (HATs), understanding how to enhance team performance is paramount. A crucially underexplored area for supporting HATs is training, particularly helping human teammates to work with these inorganic counterparts.
Caitlin M. Lancaster +5 more
wiley +1 more source
The Rainbow Connection Number of Triangular Snake Graphs
Anais do Encontro de Teoria da Computação (ETC 2020), 2020 Rainbow coloring problems, of noteworthy applications in Information Security, have been receiving much attention last years in Combinatorics. The rainbow connection number of a graph G is the least number of colors for a (not necessarily proper) edge ...
Aleffer Rocha, S. Almeida, L. Zatesko
semanticscholar +1 more source
Journal of Periodontology, EarlyView.Abstract Background The oral cavity significantly influences systemic health. Gingivitis, an early reversible stage of periodontal disease, may trigger systemic immune changes by facilitating bacterial translocation. This study examined the immune responses elicited by experimental gingivitis and their systemic immune impact, specifically in relation ...
Omnia Elebyary +5 more
wiley +1 more source
The Rainbow (Vertex) Connection Number of Pencil Graphs
Procedia Computer Science, 2015 AbstractAn edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are connnected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the smallest positive integer of colors needed in order to make G rainbow connected. The vertex-colored graph G is said rainbow vertex-connected,
Dian N. S. Simamora, A. N. M. Salman
openaire +1 more source
Rainbow Connection Number of Graph Power and Graph Products [PDF]
Graphs and Combinatorics, 2013 15 pages.
Manu Basavaraju +3 more
openaire +2 more sources
Microbial communities and functional diversity in seafood
JSFA reports, EarlyView.Abstract Functional diversity encompasses ecosystem processes that enhance adaptability to environmental change. This study explores the diversity of microorganisms associated with seafood. In this paper, we present our knowledge of microbial diversity in relation to seafood.
Christian Larbi Ayisi +3 more
wiley +1 more source
PENENTUAN RAINBOW CONNECTION NUMBER DAN STRONG RAINBOW CONNECTION NUMBER PADA GRAF BERLIAN [PDF]
Jurnal Matematika UNAND, 2017 Misalkan G = (V, E) adalah suatu graf. Suatu pewarnaan c : E(G) → {1, 2, · · · , k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama. Misalkan u, v ∈ V (G) dan P adalah suatu lintasan dari u ke v. Suatu intasan P dikatakan rainbow path jika tidak terdapat dua sisi di P berwarna
openaire +3 more sources