On some numerical characteristics of a bipartite graph

MaRDI QIDQ6251007zbMATH OpenFDO

Authors Krasimir Yordzhev

Publication date 25 April 2014

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Abstract: The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these characteristics of the set of all bipartite graphs of the type

g = l a n g l e R_{g} c u p C_{g}, E_{g} a n g l e

is formulated and proved, where

V = R_{g} c u p C_{g}

is the set of vertices,

E_{g}

is the set of edges of the graph

g

,

| R_{g} | = m g e 1

,

| C_{g} | = n g e 1

,

| E_{g} | = k g e 0

,

m, n

and

k

are integers.

This page was built for publication: On some numerical characteristics of a bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6251007)