AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 2 of 482 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
In this paper we introduce and explore the following new graph invariant: For a graph $G$ on $k$ vertices, $G \neq K_k$, let $st(n,G)$ denote the maximum number of edges in a graph of order $n$ which does not contain any subgraph on $k$ vertices strictly containing $G$. A basic relation to classical Tur\'an numbers is...
A majority C-coloring of a graph $G$ assigns colors to the vertices such that every vertex shares its color with at least half of its neighbors. The maximum number of colors that can be used in such a coloring of $G$ is denoted by $\overline{\chi}_{\geqslant}(G)$. In this paper, the focus is on the majority C-coloring...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.