Generalized sum graphs
This paper deals with \(f\)-graphs defined in the following way. Given a symmetric polynomial of two variables \(f:\mathbb{R}^ 2\to\mathbb{R}\). Then a graph \(G\) is said to be an \(f\)-graph if one can assign real numbers \(x_ 1,x_ 2,\dots,x_ n\) to its vertices \(v_ 1,v_ 2,\dots,v_ n\) so that \(\{v_ i,v_ j\}\in E(G)\) iff \(f(x_ i,x_ j)=x_ k\) for some \(k\). The main result of this paper is that for any symmetric polynomial \(f\) not all graphs are \(f\)-graphs and that for every graph \(G\) there is a symmetric polynomial \(f\) with the property that \(G\) is an \(f\)-graph.
- scientific article; zbMATH DE number 4148140
- About graph sums
- Some results on sum graphs
- scientific article; zbMATH DE number 653273
- scientific article; zbMATH DE number 6004
- scientific article; zbMATH DE number 398970
- On integral sum graphs
- On integral sum graphs
- A generalization of total graphs
- scientific article; zbMATH DE number 5307598
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Cubical graphs and cubical dimensions
- Degrees of freedom versus dimension for containment orders
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 15255 (Why is no real title available?)
- scientific article; zbMATH DE number 398970 (Why is no real title available?)
- scientific article; zbMATH DE number 867713 (Why is no real title available?)
- Lower Bounds for Approximation by Nonlinear Manifolds
This page was built for publication: Generalized sum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187945)
