Buscar
Mostrando ítems 21-30 de 56
Recognizing vertex intersection graphs of paths on bounded degree trees
(Elsevier, 2014-02)
An (h, s, t)-representation of a graph G consists of a collection of subtrees of a tree T , where each subtree corresponds to a vertex of G such that (i) the maximum degree of T is at most h, (ii) every subtree has maximum ...
On probe 2-clique graphs and probe diamond-free graphs
(Discrete Mathematics and Theoretical Computer Science, 2015)
Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exists a partition of its vertices into a set of probe vertices and a stable set of nonprobe vertices in such a way that ...
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Computación y Sistemas, 2017)
Reversal fuzzy switch graphs
(Universidade Federal do Rio Grande do NorteBrasilUFRNPROGRAMA DE PÓS-GRADUAÇÃO EM SISTEMAS E COMPUTAÇÃO, 2022-06-17)
We present a state-based Fuzzy model called Reversal Fuzzy Switch Graph (RF SG). This
model enables the activation or deactivation of edges as well as the updating of fuzzy values
from the action of aggregation functions, ...
Minimum Spanning Tree Cycle Intersection problem
(Elsevier Science, 2021-05)
Consider a connected graph G and let T be a spanning tree of G. Every edge e∈G−T induces a cycle in T∪{e}. The intersection of two distinct such cycles is the set of edges of T that belong to both cycles. We consider the ...