نتایج جستجو برای: integral graphs

تعداد نتایج: 211307  

Journal: :Ricerche Di Matematica 2023

A design graph is a regular bipartite in which any two distinct vertices of the same part have number common neighbors. This class graphs has close relationship to strongly graphs. In this paper, we study distance eigenvalues Also, will explicitly determine graphs, and values for integral, that is, its are integers.

Journal: :Des. Codes Cryptography 2012
Hyonju Yu

In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...

2017
Sapna Mehta

iv Acknowledgements v List of Tables vii List of Graphs vii

2009
Chaoyan Wang

................................................................................................................................................. 3 Acknowledgements................................................................................................................................ 6 List of Tables...........................................................................................

For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...

2013
ROGER C. ALPERIN Mark L. Lewis Roger C. Alperin

We characterize the rational subsets of a finite group and discuss the relations to integral Cayley graphs.

Journal: :CoRR 2011
Milan Basic

In this paper we answer the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer. The network is described by a circulant graph G, which is characterized by its circulant adjacency matrix A. Formally, we say that there exists a perfect state transfer (PST) between vertices a, b ∈ V (G) if |F (τ)ab| = 1, for some positive real number τ ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید