Results 41 to 50 of about 1,814,953 (245)
PENERAPAN ALGORITMA WELCH-POWELL PADA PENJADWALAN MATA PELAJARAN SD
E-Jurnal Matematika, 2023 In the context of scheduling class timetables and allocating teachers to specific subjects in schools, a common issue is the occurrence of schedule conflicts.
FINATA RASTIC ANDRARI +2 more
doaj +1 more source
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +1 more source
Perfect Roman Domination: Aspects of Enumeration and Parameterization
AlgorithmsPerfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions.
Kevin Mann, Henning Fernau
doaj +1 more source
Most switching classes with primitive automorphism groups contain graphs with trivial groups [PDF]
, 2015 The operation of switching a graph Gamma with respect to a subset X of the vertex set interchanges edges and non-edges between X and its complement, leaving the rest of the graph unchanged.
Cameron, Peter Jephson, Spiga, Pablo
core +2 more sources
Hamiltonian Indices of Three Classes of Graphs Obtained from Petersen Graph
Axioms, 2023 In this paper, we mainly consider the Hamiltonian indices of three classes of graphs obtained from Petersen graph, that is, the minimum integer m of m-time iterated line graph Lm(G) of these three classes of graphs such that Lm(G) is Hamiltonian. We show
Shengmei Lv, Liying Zhao
doaj +1 more source
A Class of Graphs of f-Class 1 [PDF]
, 2007 An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v ? V(G) at most f(v) times. The minimum number of colors needed to f-color G is called the f-chromatic index of G, and denoted by ?? f (G). Any simple graph G has f-chromatic index equal to Δ f (G) or Δ f (G) + 1, where $\Delta_{f}(G)=\max_{v\in V(G ...
Xia Zhang, Guizhen Liu
openaire +2 more sources
On hereditary Helly classes of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Graphs and Algorithms In graph theory, the Helly property has been applied to families of sets, such as cliques, disks, bicliques, and neighbourhoods, leading to the classes of clique-Helly, disk-Helly, biclique-Helly, neighbourhood-Helly graphs, respectively.
Marina Groshaus, Jayme L. Szwarcfiter
openaire +4 more sources
Monadic second-order definable graph orderings [PDF]
Logical Methods in Computer Science, 2014 We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters.
Achim Blumensath, Bruno Courcelle
doaj +1 more source
ODD HARMONIOUS LABELING ON SOME STRING GRAPH CLASSES
Barekeng, 2022 A graph with the labeling properties of odd harmonic is called an odd harmonious graph. The purpose of this research was to get labeling properties of odd harmonic on the class of string graphs. The research used was a qualitative research method.
Fery Firmansah
doaj +1 more source
The Firefighter problem on graph classes
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fedor V. Fomin +2 more
openaire +2 more sources