Main eigenvalues of a graph and its Hamiltonicity
نویسندگان
چکیده
منابع مشابه
The Main Eigenvalues of the Undirected Power Graph of a Group
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one...
متن کاملThe Main Eigenvalues of a Graph: a Survey
Let G be a simple graph with vertex set V (G) = {1, 2, . . . , n} and (0, 1)adjacency matrix A. The eigenvalue μ of A is said to be a main eigenvalue of G if the eigenspace E(μ) is not orthogonal to the all-1 vector j. An eigenvector x is a main eigenvector if xj 6= 0. The main eigenvalues of the connected graphs of order ≤ 5 are listed in [12, Appendix B], and those of all the connected graphs...
متن کاملEla on the Main Signless Laplacian Eigenvalues of a Graph
A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...
متن کاملtransference of imagery: a comparative formalistic study of shakespeares hamlet and its two persian translations
هدف از این تحقیق بررسی انتقال صور خیال هملت در دو ترجمه ی فارسی آن از نظر فرمالیستی بود. برای بدست آوردن داده-های مورد نیاز، 130 نمونه استعاره، مجاز، ایهام، کنایه و پارادوکس در متن اصلی مشخص شده و سپس بر اساس مدل نیومارک (1998) برای ترجمه ی استعاره یا بطور کلی زبان مجاز با معادل های فارسی شان مقایسه گردیدند. این تحقیق بر آن بود تا روش های استفاده شده برای ترجمه هر کدام از انواع زبان مجاز ذکر شد...
15 صفحه اولDeciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series
سال: 2020
ISSN: 2524-2415,1561-2430
DOI: 10.29235/1561-2430-2020-56-4-398-407