The graphs with all but two eigenvalues equal to $$-2$$ - 2 or 0
نویسندگان
چکیده
منابع مشابه
P O B O X 1 1 7 2 2 1 0 0 L U N D + 4 6 4 6 -2 2 2 0 0 0 0 Are All Opposites Equal -or Are Some More Equal than Others?
for UCL, 27 November, 2013 Are all opposites equal – or are some more equal than others? Carita Paradis, Centre for Languages and Literature, Lund University At the one extreme, antonyms show up as strongly associated pairs such as long–short, heavy–light, hot–cold and good–bad along the dimensions of LENGTH, WEIGHT, TEMPERATURE and MERIT, respectively, While other pairs appear to be less obvio...
متن کاملSmall graphs with exactly two non-negative eigenvalues
Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)
متن کاملThe Matching Equivalence Graphs with the Maximum Matching Root Less than or Equal to 2
In the paper, we give a necessary and sufficient condition of matching equivalence of two graphs with the maximum matching root less than or equal to 2.
متن کاملAre all COX-2 inhibitors created equal?
Prostaglandins (PGs) are biologically active lipids derived from the cyclooxygenase (COX)-mediated metabolism of arachidonic acid. They are constitutively produced in certain tissues (eg, brain, gut, and kidney), and their synthesis is increased at sites of inflammation. Prostanoids function as important mediators of inflammation and modulate a variety of physiological processes, including main...
متن کاملGraphs with equal domination and 2-domination numbers
For a graph G a subset D of the vertex set of G is a k-dominating set if every vertex not in D has at least k neighbors in D. The k-domination number γk(G) is the minimum cardinality among the k-dominating sets of G. Note that the 1-domination number γ1(G) is the usual domination number γ(G). Fink and Jacobson showed in 1985 that the inequality γk(G) ≥ γ(G) + k − 2 is valid for every connected ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2016
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-016-0241-4