A characteristic approach to bipartite graphs as incidence graphs

Authors

  • McKee, Terry A.

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.

Published

2005-06-09

How to Cite

McKee, Terry A. (2005). A characteristic approach to bipartite graphs as incidence graphs. Utilitas Mathematica, 68. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/347

Issue

Vol. 68 (2005): Volume 68, 2005

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.