Results 11 to 20 of about 3,440 (243)
On graphs double-critical with respect to the colouring number [PDF]
The colouring number col($G$) of a graph $G$ is the smallest integer $k$ for which there is an ordering of the vertices of $G$ such that when removing the vertices of $G$ in the specified order no vertex of degree more than $k-1$ in the remaining graph ...
Matthias Kriesell, Anders Pedersen
doaj +2 more sources
Edge Colouring of Neutrosophic Graphs and Its Application in Detection of Phishing Website [PDF]
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 +2 more sources
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 +2 more sources
Application of Graph Colouring Algorithm in Course Scheduling Process
Scheduling is a crucial aspect in every occurrence, ensuring that all processes are orderly. Gema Nusantara Bukittinggi Health Vocational School currently utilizes Microsoft Excel for managing subject scheduling, which often leads to scheduling conflicts.
Nella Lestari Borotan +3 more
doaj +3 more sources
A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem [PDF]
Graph colouring problem is a well-known NP-class optimization problem, studied due to a lot of applications in various real-world problems. Some of these applications are: register allocation, image processing and communication networks.
Ajay Shukla, Vishal Bharti, M. Garg
doaj +1 more source
Two-Step Colouring of Grid Graphs of Different Types
In this article, we consider the NP-hard problem of the two-step colouring of a graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or 2 ...
Alexander Valeryevich Smirnov
doaj +1 more source
Fuzzy dominator coloring on fuzzy soft graphs
A fuzzy soft dominator colouring of a fuzzy soft graph $G^S$(T,V) is an appropriate fuzzy soft colouring such that every single vertex of $G^S$(T,V) dominate entire vertex of a colour group.
Jahir Hussain Rasheed, Afya Farhana
doaj +1 more source
The Metric Chromatic Number of Zero Divisor Graph of a Ring Zn
Let Γ be a nontrivial connected graph, c:VΓ⟶ℕ be a vertex colouring of Γ, and Li be the colouring classes that resulted, where i=1,2,…,k. A metric colour code for a vertex a of a graph Γ is ca=da,L1,da,L2,…,da,Ln, where da,Li is the minimum distance ...
Husam Qasem Mohammad +2 more
doaj +1 more source
Acyclic, Star and Oriented Colourings of Graph Subdivisions [PDF]
Let G be a graph with chromatic number χ (G). A vertex colouring of G is \emphacyclic if each bichromatic subgraph is a forest. A \emphstar colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ _a(G) and χ _s(G)
David R. Wood
doaj +3 more sources
On \delta^(k)-colouring of Powers of Paths and Cycles
In a proper vertex colouring of a graph, the vertices are coloured in such a way that no two adjacent vertices receive the same colour, whereas in an improper vertex colouring, adjacent vertices are permitted to receive same colours subjected to some ...
Merlin Ellumkalayil, Sudev Naduvath
doaj +1 more source

