Buscar
Mostrando ítems 1-10 de 2510
Shifts of the stable Kneser graphs and hom-idempotence
(Academic Press Ltd - Elsevier Science Ltd, 2017-05)
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n≥1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n,k) are ...
k-tuple colorings of the Cartesian product of graphs
(Elsevier Science, 2017-01)
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G, χk(G), is the smallest ...
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 ...
On probe 2-clique graphs and probe diamond-free graphs
(Chapman & Hall, 2015-03)
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 ...
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, ...
Exploiting computation-friendly graph compression methods for adjacency-matrix multiplication
(Institute of Electrical and Electronics Engineers Inc., 2018)
Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In this paper ...
Pebbling in Split Graphs
(Society for Industrial and Applied Mathematics, 2014-08)
Graph pebbling is a network optimization model for transporting discrete resourcesthat are consumed in transit: the movement of 2 pebbles across an edge consumes one of thepebbles. The pebbling number of a graph is the ...
Thinness of product graphs
(Elsevier Science, 2022)