آمار
| تعداد نشریات | 6 |
| تعداد شمارهها | 125 |
| تعداد مقالات | 1,586 |
| تعداد مشاهده مقاله | 1,757,319 |
| تعداد دریافت فایل اصل مقاله | 1,638,622 |
Traversibility of subspace based nonzero component graph of vector spaces over finite fields | ||
| Communications in Combinatorics and Optimization | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 02 شهریور 1405 | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2026.30897.2658 | ||
| نویسندگان | ||
| Shariefuddin Pirzada* 1؛ Bilal Wani2؛ Zhou Guofei3 | ||
| 1Department of Mathematics, Hazratbal | ||
| 2National Institute of Technology Srinagar | ||
| 3Nanjing University | ||
| چکیده | ||
| Let $\mathbb{V}$ be an $n$-dimensional vector space over a field $\mathcal{F}$ having basis $\mathcal{B}=\left\lbrace \alpha_1, \alpha_2, \dots, \alpha_n\right\rbrace $ and $W$ be an $m$ dimensional subspace of $\mathbb{V}$ with basis $\{\alpha_{w_1}, \alpha_{w_2},\dots, \alpha_{w_m}\}$, where $\alpha_{w_i}$ is some $\alpha_{j}\in \mathcal{B}$. The $subspace~based~nonzero~component~graph$, denoted by $\Gamma_W(\mathbb{V}_\alpha)=\left( V,E\right)$, of a finite dimensional vector space with respect to $W$ and $\mathcal{B}$ is defined as follows: $V=\mathbb{V}\setminus W$ and for $\mathbf{u},\mathbf{v}\in V$, there is an edge between $\mathbf{u}$ and $\mathbf{v}$ if and only if either $W_{\mathbf{u}}\subset W_{\mathbf{v}}$ or $W_{\mathbf{v}}\subset W_{\mathbf{w}}$, where $\mathbf{u}=u_1\alpha_1+u_2\alpha_2+\dots+u_k\alpha_k$, $1\leq k\leq n$ and $W_{\mathbf{u}}=\{\alpha_{w_1}, \alpha_{w_2},\dots, \alpha_{w_m}\}\cup \{\alpha_1, \alpha_2, \dots, \alpha_k\}$. In this paper, we determine the order, size and edge-connectivity of $\Gamma_W(\mathbb{V}_\alpha)$. We show that the graph $\Gamma_W(\mathbb{V}_\alpha)$ is Hamiltonian but not Eulerian. We also show that under some mild conditions, the graph $\Gamma_W(\mathbb{V}_\alpha)$ lies on a triangle. Finally, we determine the clique number and the chromatic number of $\Gamma_W(\mathbb{V}_\alpha)$. | ||
| کلیدواژهها | ||
| Vector space؛ graph, Maximal cliques؛ Hamiltonian graph | ||
|
آمار تعداد مشاهده مقاله: 1 |
||