On balanced graphs

Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced graphs by forbidden subgraphs and by clique subgraphs are proved in this work....

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Durán, G., Lin, M.C., Szwarcfiter, J.L.
Formato: JOUR
Materias:
0-1 matrices
Algorithms
Balanced graphs
Balanced hypergraphs
Clique graphs
Domination
Graph theory
Matrix algebra
Polynomials
Mathematical programming
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_00255610_v105_n2-3_p233_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares