A function on graphs

MaRDI QIDQ1594148zbMATH OpenFDO

Authors E. N. Kuz'min

Publication date 28 January 2001

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

admissible subgraphsIvanovskij function

Mathematics Subject Classification ID

Graph theory (05C99)

Review text

An undirected graph \(G\) is considered which may contain loops and multiple edges. A subgraph \(\Gamma\) of \(G\) is called admissible, if it contains all vertices of \(G\) and each vertex in \(\Gamma\) has an odd degree. By means of the set of admissible subgraphs of \(G\), the so-called Ivanovskij function \(f(x)\) is defined. The main theorem says that always \(f(x)\equiv 0\pmod {2^b}\), where \(b=r+s-n\), here \(r,s,n\) are the number of edges, connected components and vertices of \(G\), respectively. It seems to the reviewer that the author neglected exactness in the notation and thus the paper is not quite intelligible.

Recommendations

• scientific article; zbMATH DE number 1225797
• Factors and vertex-deleted subgraphs
• scientific article; zbMATH DE number 1420459
• Odd and even factors with given properties
• scientific article; zbMATH DE number 4018944

Cited in

(5)

• Functions with Dense Graphs
• scientific article; zbMATH DE number 3878987 (Why is no real title available?)
• scientific article; zbMATH DE number 5278898 (Why is no real title available?)
• scientific article; zbMATH DE number 1225797 (Why is no real title available?)
• scientific article; zbMATH DE number 2108128 (Why is no real title available?)

This page was built for publication: A function on graphs

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