Results 41 to 50 of about 2,800 (262)
Applications of Edge Colouring of Fuzzy Graphs [PDF]
Summary: Colouring of graphs is being used in several representations of real world systems like map colouring, traffic signalling, etc. This study introduces the edge colouring of fuzzy graphs. The chromatic index and the strong chromatic index are defined and related properties are investigated.
Rupkumar Mahapatra +2 more
openaire +1 more source
A note on face coloring entire weightings of plane graphs
Given a weighting of all elements of a 2-connected plane graph G = (V,E, F), let f(α) denote the sum of the weights of the edges and vertices incident with the face _ and also the weight of _.
Jendrol Stanislav, Šugerek Peter
doaj +1 more source
Edges, colour and awareness in blindsight
It remains unclear what is being processed in blindsight in response to faces, colours, shapes, and patterns. This was investigated in two hemianopes with chromatic and achromatic stimuli with sharp or shallow luminance or chromatic contrast boundaries or temporal onsets. Performance was excellent only when stimuli had sharp spatial boundaries.
Alexander, I, Cowey, A
openaire +2 more sources
Total Graph Interpretation of the Numbers of the Fibonacci Type
We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give
Urszula Bednarz +2 more
doaj +1 more source
Mixed graph colouring as scheduling multi-processor tasks with equal processing times
A problem of scheduling partially ordered unit-time tasks processed on dedicated machines is formulated as a mixed graph colouring problem, i. e., as an assignment of integers (colours) {1, 2, …, t} to the vertices (tasks) V {ν1, ν2, …, νn}, of the mixed
Yuri N. Sotskov
doaj +1 more source
On distance edge-colourings and matchings
Abstract We consider a distance generalisation of the strong chromatic index and the maximum induced matching number, for graphs of bounded maximum degree and Erdős-Renyi random graphs.
Ross J. Kang, Putra Manggala
openaire +1 more source
ABSTRACT Background Although significant progress has been made in childhood leukemia survival, healthcare providers, and caregivers often face challenges in explaining this disease to patients. Disease‐targeted storybooks have been proposed as a tool to facilitate the understanding of diagnoses and treatment.
Nutvipha Ummartyotin +6 more
wiley +1 more source
Edge Colouring of Neutrosophic Graphs and Its Application in Detection of Phishing Website
Graph colouring enjoys many practical as well as theoretical uses. Graph colouring is still a very active subject of research. This article introduces a new concept of the chromatic number of the neutrosophic graph (NG).
Rupkumar Mahapatra +2 more
doaj +1 more source
Complexity separating classes for edge-colouring and total-colouring [PDF]
Abstract The class of unichord-free graphs was recently investigated in a series of papers (Machado et al. in Theor. Comput. Sci. 411:1221–1234, 2010; Machado, de Figueiredo in Discrete Appl. Math. 159:1851–1864, 2011; Trotignon, Vušković in J. Graph Theory 63:31–67, 2010) and proved to be useful with respect to the study of the complexity of
Raphael C. S. Machado +1 more
openaire +2 more sources
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source

