Results 31 to 40 of about 156 (148)
Anti-Ramsey numbers for disjoint copies of graphs [PDF]
Opuscula Mathematica, 2017 A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph \(G\) and a positive integer \(n\), the anti-Ramsey number \(ar(n,G)\) is the maximum number of colors in an edge-coloring of \(K_n\) with no ...
Izolda Gorgol, Agnieszka Görlich
doaj +1 more source
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS
BarekengThe concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan +4 more
doaj +1 more source
Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph
Jurnal Matematika MANTIK, 2022 An edge labeling of graph G is a function g from the edge set of graph G to the first natural numbers up to the number of the edge set. Graph G admits a rainbow vertex antimagic coloring if, for any two vertices, there is a path with different colors of all internal vertices. The vertex color of graph G is assigned by vertex weight.
openaire +1 more source
Human‐in‐the‐Loop Object Segmentation for 3D Gaussian Splatting via Finger‐based VR Interface
Advanced Intelligent Systems, EarlyView.This study introduces a human‐in‐the‐loop segmentation framework for 3D Gaussian Splatting that integrates real‐time optimization with intuitive VR‐based finger prompting. Compared with existing automatic, learning‐based methods, it achieves significantly higher accuracy and reduced segmentation time.
Yongseok Lee +5 more
wiley +1 more source
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, EarlyView.ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Contemporary Mathematics and Applications (ConMathA)Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir +4 more
doaj +1 more source
WORM Colorings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj +1 more source
Labyrinthine Abnormalities on MRI in Untreated Otosclerosis: Prevalence and Clinical Relevance
The Laryngoscope, EarlyView.In untreated otosclerosis with labyrinthine symptoms, delayed 3D FLAIR MRI rarely demonstrates endolymphatic hydrops but frequently reveals blood–labyrinth barrier (BLB) disruption. BLB enhancement is spatially associated with cochlear endosteal and round window involvement and increases with the severity of the hearing loss phenotype.
Héléna Pencroffi +7 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2015 Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F, we define an F-WORM coloring of G as
Goddard Wayne, Wash Kirsti, Xu Honghai
doaj +1 more source