Buscar
Mostrando ítems 21-30 de 15882
StructMatrix: large-scale visualization of graphs by means of structure detection and dense matrices
(Institute of Electrical and Electronics Engineers – IEEEAtlantic City, 2015-11)
Given a large-scale graph with millions of nodes and edges, how to reveal macro patterns of interest, like cliques, bi-partite cores, stars, and chains? Furthermore, how to visualize such patterns altogether getting insights ...
On Delta-Graphs And Delta Conjecture
(Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica., 2018)
On the correspondence between tree representations of chordal and dually chordal graphs
(Elsevier, 2014-02)
Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively. The following problem is studied: given a ...
Characterization of classical graph classes by weighted clique graphs
(Elsevier Science, 2014-03)
Given integers m1,…,mℓ, the weighted clique graph of G is the clique graph K(G), in which there is a weight assigned to each complete set S of size mi of K(G), for each i=1,…,ℓ. This weight equals the cardinality of the ...
UNIVERSALITY OF RANDOM GRAPHS
(SIAM PUBLICATIONSPHILADELPHIA, 2012)
We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we ...
Graphs admitting antimagic labeling for arbitrary sets of positive integers
(Elsevier, 2017)
A connected graph G=(V,E) with m edges is called universal antimagic if for each set B of m positive integers there is an bijective function f:E→B such that the function f˜:V→N defined at each vertex v as the sum of all ...