Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs
نویسندگان
چکیده
منابع مشابه
Normalized laplacian spectrum of two new types of join graphs
Let $G$ be a graph without an isolated vertex, the normalized Laplacian matrix $tilde{mathcal{L}}(G)$ is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$, where $mathcal{D}$ is a diagonal matrix whose entries are degree of vertices of $G$. The eigenvalues of $tilde{mathcal{L}}(G)$ are called as the normalized Laplacian eigenva...
متن کاملnormalized laplacian spectrum of two new types of join graphs
let $g$ be a graph without an isolated vertex, the normalized laplacian matrix $tilde{mathcal{l}}(g)$is defined as $tilde{mathcal{l}}(g)=mathcal{d}^{-frac{1}{2}}mathcal{l}(g) mathcal{d}^{-frac{1}{2}}$, where $mathcal{d}$ is a diagonal matrix whose entries are degree of vertices of $g$. the eigenvalues of$tilde{mathcal{l}}(g)$ are called as the normalized laplacian ...
متن کاملSpatial Joins and R-trees
One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. The paper gives contemporary state in this research area and presents effective algorithm for spatial joins which combines both I/O and CPU cost optimization. This algorithm is designed like a multi-step process [4] and ...
متن کاملConnected Joins in Graphs
A join in a graph is a set F of edges such that for every circuit C, |C ∩ F | ≤ |C \ F |. We study the problem of finding a connected join covering a given subset of vertices of the graph, that is a Steiner tree which is a join at the same time. This turns out to contain the question of finding a T -join of minimum cardinality (or weight) which is, in addition, connected. This last problem is m...
متن کاملFaster Joins , Self - Joins and
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross. Stripe-join makes a single sequential pass through each input relation, in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identiiers but no input tuples. Stripe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2018
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2017.10.006