相关论文: Independent sets in association schemes

Let $H=(V,E)$ be an $s$-uniform hypergraph of order $n$ and $k\geq 0$ be an integer. A $k$-independent set $S\subseteq H$ is a set of vertices such that the maximum degree in the hypergraph induced by $S$ is at most $k$. Denoted by…

If $A$ is an independent set of a graph $G$ such that the vertices in $A$ have different degrees, then we call $A$ an irregular independent set of $G$. If $D$ is a dominating set of $G$ such that the vertices that are not in $D$ have…

We consider a natural, yet seemingly not much studied, extremal problem in bipartite graphs. A bi-hole of size $t$ in a bipartite graph $G$ is a copy of $K_{t, t}$ in the bipartite complement of $G$. Let $f(n, \Delta)$ be the largest $k$…

Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a $d$-regular graph is maximized by disjoint copies of…

A $k$-uniform hypergraph $H = (V, E)$ is $k$-partite if $V$ can be partitioned into $k$ sets $V_1, \ldots, V_k$ such that every edge in $E$ contains precisely one vertex from each $V_i$. We call such a graph $n$-balanced if $|V_i| = n$ for…

Let $\mathcal{A}(H)$ be the adjacency tensor of $r$-uniform hypergraph $H$. If $H$ is connected, the unique positive eigenvector $x=(x_1,x_2,\ldots,x_n)^{\mathrm{T}}$ with $||x||_r=1$ corresponding to spectral radius $\rho(H)$ is called the…

We study the existence and the number of $k$-dominating independent sets in certain graph families. While the case $k=1$ namely the case of maximal independent sets - which is originated from Erd\H{o}s and Moser - is widely investigated,…

The (n,k)-star graph is a very important computer modelling. The independent number and chromatic number of a graph are two important parameters in graph theory. However, we did not know the values of this two parameters of the (n,k)-star…

We introduce a new framework for reconfiguration problems, and apply it to independent sets as the first example. Suppose that we are given an independent set $I_0$ of a graph $G$, and an integer $l \ge 0$ which represents a lower bound on…

The independence number $\alpha(G)$ is the cardinality of a maximum independent set, while $\mu(G)$ is the size of a maximum matching in $G$. If $\alpha(G)+\mu(G)$ equals the order of $G$, then $G$ is called a Konig-Egervary graph. The…

We determine the maximum number of maximal independent sets of arbitrary graphs in terms of their covering numbers and we completely characterize the extremal graphs. As an application, we give a similar result for K\"onig-Egerv\'ary graphs…

A set C of vertices of a graph is P_3-convex if every vertex outside C has at most one neighbor in C. The convex hull \sigma(A) of a set A is the smallest P_3-convex set that contains A. A set M is convexly independent if for every vertex x…

This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size, independence number and maximum degree. We also construct…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be a diagonal matrix of the degrees of $G$. In 2017, Nikiforov defined the $A_{\alpha}$-matrix of $G$ as \begin{equation*} A_{\alpha}(G)=\alpha G)+(1-\alpha)A(G),…

Let $G$ be a graph of order $n$ and size $m$, and let $\mathrm{mc}_{k}\left( G\right) $ be the maximum size of a $k$-cut of $G.$ It is shown that \[ \mathrm{mc}_{k}\left( G\right) \leq\frac{k-1}{k}\left( m-\frac{\mu_{\min }\left( G\right)…

The $\lambda$-core vertices of a graph correspond to the non-zero entries of some eigenvector of $\lambda$ for a universal adjacency matrix $\mathbf{U}$ of the graph. We define a partition of the vertex set $V$ based on the $\lambda$-core…

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathcal{I}(G)$, is the graph whose vertices correspond to the…

A set S of vertices is independent in a graph G if no two vertices from S are adjacent, and alpha(G) is the cardinality of a maximum independent set of G. G is called a Konig-Egervary graph if its order equals alpha(G)+mu(G), where mu(G)…

Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations…

We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…