Results 91 to 100 of about 5,334 (146)

Edge Roman domination on graphs

open access: yes, 2014
An edge Roman dominating function of a graph $G$ is a function $f\colon E(G) \rightarrow \{0,1,2\}$ satisfying the condition that every edge $e$ with $f(e)=0$ is adjacent to some edge $e'$ with $f(e')=2$.
Chang, Gerard J.   +2 more
core  

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

open access: yesSpecial Matrices, 2014
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all ...
Taklimi Fatemeh Alinaghipour   +2 more
doaj   +1 more source

The complexity of frugal colouring. [PDF]

open access: yesArab J Math, 2021
Bard S, MacGillivray G, Redlin S.
europepmc   +1 more source

Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2015
Given graphs G and H, a vertex coloring c : V (G) →ℕ is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ (H,G), is the minimum number of colors in an H-free coloring of G.
Kubicka Ewa   +2 more
doaj   +1 more source

Horizontal visibility graph of a random restricted growth sequence. [PDF]

open access: yesAdv Appl Math, 2021
Mansour T, Rastegar R, Roitershtein A.
europepmc   +1 more source

Choosability with separation of cycles and outerplanar graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2023
Jean-Christophe Godin, Oliver Togni
doaj   +1 more source

A note on compact and compact circular edge-colorings of graphs

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj  

Clustering systems of phylogenetic networks. [PDF]

open access: yesTheory Biosci, 2023
Hellmuth M, Schaller D, Stadler PF.
europepmc   +1 more source

Network Pollution Games. [PDF]

open access: yesAlgorithmica, 2019
Anastasiadis E   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy