Diameter of Io-Decomposable Riordan Graphs of the Bell Type
نویسندگان
چکیده
Recently, in the paper (Cheon et al. Linear Algebra Appl 579:89–135, 2019) we suggested two conjectures about diameter of io-decomposable Riordan graphs Bell type. In this paper, give a counterexample for first conjecture. Then prove that conjecture is true some particular size and propose new Finally, show second special graphs.
منابع مشابه
the investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
Constructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملOn Diameter of Line Graphs
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
متن کاملRobustness of Entanglement for Bell Decomposable States
We propose a simple geometrical approach for finding the robustness of entanglement for Bell decomposable states of 2 ⊗ 2 quantum systems. It is shown that the robustness of entanglement is equal to the concurrence. We also present an analytical expression for two separable states that wipe out all entanglement of these states. Finally the random robustness of these states is also obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2021
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-021-02427-1