Characterization of classical graph classes by weighted clique graphs

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 intersection of the cliques of G corresponding to S. We characterize weighted cl...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Szwarcfiter, J.L.
Formato: JOUR
Materias:
Graph classes structural characterization
Weighted clique graphs
Characterization
Graph theory
Cardinalities
Chordal graphs
Clique graphs
Graph class
Interval graph
Proper interval graphs
Split graphs
Structural characterization
Graphic methods
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v165_n_p83_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares