DIAGONAL HYPERGRAPH OF A MATRIX (BIPARTITE GRAPH)

被引:7
作者
BRUALDI, RA
机构
[1] Department of Mathematics, University of Wisconsin, Madison
基金
美国国家科学基金会;
关键词
D O I
10.1016/0012-365X(79)90105-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let A be an n x n matrix of 0's and 1's (a bipartite graph). The diagonal hypergraph of A is the hypergraph whose vertices correspond to the 1's (edges) of A and whose edges correspond to the positive diagonals (1-factors) of A. The numerical invariants of this hypergraph are investigated. © 1979.
引用
收藏
页码:127 / 147
页数:21
相关论文
共 7 条
[1]  
BERGE C, UNPUBLISHED
[2]  
Berge C., 1978, ANN DISCRETE MATH, V3, P11
[3]  
Berge C., 1973, GRAPHS HYPERGRAPHS
[4]   CONVEX POLYHEDRA OF DOUBLY STOCHASTIC MATRICES .1. APPLICATIONS OF PERMANENT FUNCTION [J].
BRUALDI, RA ;
GIBSON, PM .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1977, 22 (02) :194-230
[5]  
Ford Lester R., 1962, FLOWS NETWORKS
[6]   MAXIMUM NUMBER OF DISJOINT PERMUTATIONS CONTAINED IN MATRIX OF ZEROS + ONES [J].
FULKERSON, DR .
CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (04) :729-+
[7]  
Marcus M., 1964, SURVEY MATRIX THEORY