Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Afshari, B."'
Autor:
Afshari, B., Afshari, M.
Let $G$ be a graph on $n$ nodes with algebraic connectivity $\lambda_{2}$. The eccentricity of a node is defined as the length of a longest shortest path starting at that node. If $s_\ell$ denotes the number of nodes of eccentricity at most $\ell$, t
Externí odkaz:
http://arxiv.org/abs/2407.02535
Autor:
Afshari, B.
Denote the Laplacian of a graph $G$ by $L(G)$ and its second smallest Laplacian eigenvalue by $\lambda_2(G)$. If $G$ is a graph on $n\ge 2$ vertices, then it is shown that the second smallest eigenvalue of $L(G) + \frac{1}{n} L(\overline{G^2})$ is at
Externí odkaz:
http://arxiv.org/abs/2109.04568
Publikováno v:
Linear Algebra Appl. (2018)
For a graph $G$, let $\lambda_2(G)$ denote its second smallest Laplacian eigenvalue. It was conjectured that $\lambda_2(G) + \lambda_2(\overline G) \ge 1$, where $\overline G$ is the complement of $G$. In this paper, it is shown that $\max\{\lambda_2
Externí odkaz:
http://arxiv.org/abs/1806.06770
Autor:
Afshari, B. (AUTHOR) afshari.b@ipm.ir
Publikováno v:
Journal of Graph Theory. Oct2023, Vol. 104 Issue 2, p275-281. 7p.
Publikováno v:
In Linear Algebra and Its Applications 15 December 2021 631:136-142
Autor:
Afshari, B., Akbari, S.
Publikováno v:
In Linear Algebra and Its Applications 1 August 2019 574:22-29
Publikováno v:
31st EACSL Annual Conference on Computer Science Logic: CSL 2023, February 13-16, 2023, Warsaw, Poland
31st EACSL Annual Conference on Computer Science Logic
31st EACSL Annual Conference on Computer Science Logic
Full Computation Tree Logic, commonly denoted CTL*, is the extension of Linear Temporal Logic LTL by path quantification for reasoning about branching time. In contrast to traditional Computation Tree Logic CTL, the path quantifiers are not bound to
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Logic, Language, Information, and Computation: 28th International Workshop, WoLLIC 2022, Iași, Romania, September 20–23, 2022 : proceedings
Logic, Language, Information, and Computation
Logic, Language, Information, and Computation ISBN: 9783031152979
Logic, Language, Information, and Computation
Logic, Language, Information, and Computation ISBN: 9783031152979
Cyclic proof systems permit derivations that are finite graphs in contrast to conventional derivation trees. The soundness of such proofs is ensured by a condition on the paths through the derivation graph, known as the global trace condition. To giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1742e40630cccc396470bc5b6ee9c6f7
https://dare.uva.nl/personal/pure/en/publications/abstract-cyclic-proofs(7f72f798-014e-47a9-a438-393978d73b6b).html
https://dare.uva.nl/personal/pure/en/publications/abstract-cyclic-proofs(7f72f798-014e-47a9-a438-393978d73b6b).html
Publikováno v:
Afshari, B. (ed.), THE PROOF SOCIETY: AUTUMN SCHOOL AND WORKSHOP (TPS2022), 7-12 November 2022, Utrecht, The Netherlands, 43-44. Utrecht; Amsterdam : Evert Willem Beth Foundation
STARTPAGE=43-44;TITLE=Afshari, B. (ed.), THE PROOF SOCIETY: AUTUMN SCHOOL AND WORKSHOP (TPS2022), 7-12 November 2022, Utrecht, The Netherlands
STARTPAGE=43-44;TITLE=Afshari, B. (ed.), THE PROOF SOCIETY: AUTUMN SCHOOL AND WORKSHOP (TPS2022), 7-12 November 2022, Utrecht, The Netherlands
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6928067c43041d39c586dfe502a6e417
http://hdl.handle.net/2066/286464
http://hdl.handle.net/2066/286464