A Characteristic Approach to Bipartite Graphs and Incidence Graphs |
| |
| Institution: | 1. Faculty of Applied Science & Technology, Sheridan College, 7899 McLaughlin Road, Brampton, Ontario, L6Y 5H9, Canada;2. Department of Computer Science, Aalto University, P.O. Box 15400, FI-00076 Aalto, Finland;3. Seneca College, 70 The Pond Road, Toronto, Ontario, M3J 3M6, Canada;1. Computer Science Unit, Indian Statistical Institute, Chennai, India;2. Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India |
| |
| Abstract: | A ‘bipartite characteristic’ parameter is defined for bipartite graphs that mimics the (Euler) characteristic—the number of vertices, minus the number of edges, plus the number of triangles, minus the number of 4-cliques, etc.—of general graphs. This allows the characterization of linear, totally balanced, acyclic, tree, and biacyclic hypergraphs in terms of the bipartite characteristic values of their incidence graphs. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
