Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Laplacian matrix" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    The Laplacian spectrum of some digraphs obtained from the wheel
    Autorzy:
    Su, Li
    Li, Hong-Hai
    Zheng, Liu-Rong
    Powiązania:
    https://bibliotekanauki.pl/articles/743220.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    digraph
    Laplacian matrix
    eigenvalue
    wheel
    Opis:
    The problem of distinguishing, in terms of graph topology, digraphs with real and partially non-real Laplacian spectra is important for applications. Motivated by the question posed in [R. Agaev, P. Chebotarev, Which digraphs with rings structure are essentially cyclic?, Adv. in Appl. Math. 45 (2010), 232-251], in this paper we completely list the Laplacian eigenvalues of some digraphs obtained from the wheel digraph by deleting some arcs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2012, 32, 2; 255-261
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Order unicyclic graphs according to spectral radius of unoriented laplacian matrix
    Autorzy:
    Fan, Yi-Zheng
    Wu, Song
    Powiązania:
    https://bibliotekanauki.pl/articles/743077.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    unicyclic graph
    Laplacian matrix
    spectral radius
    Opis:
    The spectral radius of a graph is defined by that of its unoriented Laplacian matrix. In this paper, we determine the unicyclic graphs respectively with the third and the fourth largest spectral radius among all unicyclic graphs of given order.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2008, 28, 3; 487-499
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The signless Laplacian spectral radius of graphs with given number of cut vertices
    Autorzy:
    Cui, Lin
    Fan, Yi-Zheng
    Powiązania:
    https://bibliotekanauki.pl/articles/744527.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    graph
    cut vertex
    signless Laplacian matrix
    spectral radius
    Opis:
    In this paper, we determine the graph with maximal signless Laplacian spectral radius among all connected graphs with fixed order and given number of cut vertices.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2010, 30, 1; 85-93
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An upper bound on the Laplacian spectral radius of the signed graphs
    Autorzy:
    Li, Hong-Hai
    Li, Jiong-Sheng
    Powiązania:
    https://bibliotekanauki.pl/articles/743035.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Laplacian matrix
    signed graph
    mixed graph
    largest Laplacian eigenvalue
    upper bound
    Opis:
    In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and those of a mixed graph, gave a new upper bound for the largest Laplacian eigenvalue of a signed graph and characterized the extremal graph whose largest Laplacian eigenvalue achieved the upper bound. In addition, an example showed that the upper bound is the best in known upper bounds for some cases.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2008, 28, 2; 345-359
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fractional Revival of Threshold Graphs Under Laplacian Dynamics
    Autorzy:
    Kirkland, Steve
    Zhang, Xiaohong
    Powiązania:
    https://bibliotekanauki.pl/articles/31552789.pdf
    Data publikacji:
    2020-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Laplacian matrix
    spectral decomposition
    quantum information transfer
    fractional revival
    Opis:
    We consider Laplacian fractional revival between two vertices of a graph $X$. Assume that it occurs at time \(\tau\) between vertices 1 and 2. We prove that for the spectral decomposition \(L=∑_{r=0}^qθ_rE_r\) of the Laplacian matrix $L$ of $X$, for each $r = 0, 1, . . ., q$, either $E_re_1 = E_re_2$, or $E_re_1 = −E_re_2$, depending on whether \(e^{i\tauθ_r}\) equals to 1 or not. That is to say, vertices 1 and 2 are strongly cospectral with respect to $L$. We give a characterization of the parameters of threshold graphs that allow for Laplacian fractional revival between two vertices; those graphs can be used to generate more graphs with Laplacian fractional revival. We also characterize threshold graphs that admit Laplacian fractional revival within a subset of more than two vertices. Throughout we rely on techniques from spectral graph theory.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 2; 585-600
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Some Properties of the Eigenvalues of the Net Laplacian Matrix of a Signed Graph
    Autorzy:
    Stanić, Zoran
    Powiązania:
    https://bibliotekanauki.pl/articles/32304147.pdf
    Data publikacji:
    2022-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    (net) Laplacian matrix
    edge perturbations
    largest eigenvalue
    net-degree
    Opis:
    Given a signed graph $ \dot{G} $, let $ A_{ \dot{G} } $ and $ D_{\dot{G}}^\pm $ denote its standard adjacency matrix and the diagonal matrix of vertex net-degrees, respectively. The net Laplacian matrix of $ \dot{G} $ is defined to be $ N_{ \dot{G} } = D_{\dot{G}}^\pm - A_{ \dot{G} } $. In this study we give some properties of the eigenvalues of $ N_{ \dot{G} } $. In particular, we consider their behaviour under some edge perturbations, establish some relations between them and the eigenvalues of the standard Laplacian matrix and give some lower and upper bounds for the largest eigenvalue of $ N_{ \dot{G} } $.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2022, 42, 3; 893-903
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Constrained spectral clustering via multi-layer graph embeddings on a Grassmann manifold
    Autorzy:
    Trokicić, Aleksandar
    Todorović, Branimir
    Powiązania:
    https://bibliotekanauki.pl/articles/329780.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    spectral clustering
    constrained clustering
    multilayer graph
    Grassmann manifold
    Nyström method
    Laplacian matrix
    grupowanie widmowe
    graf wielowarstwowy
    metoda Nyströma
    macierz Laplaciana
    Opis:
    We present two algorithms in which constrained spectral clustering is implemented as unconstrained spectral clustering on a multi-layer graph where constraints are represented as graph layers. By using the Nystrom approximation in one of the algorithms, we obtain time and memory complexities which are linear in the number of data points regardless of the number of constraints. Our algorithms achieve superior or comparative accuracy on real world data sets, compared with the existing state-of-the-art solutions. However, the complexity of these algorithms is squared with the number of vertices, while our technique, based on the Nyström approximation method, has linear time complexity. The proposed algorithms efficiently use both soft and hard constraints since the time complexity of the algorithms does not depend on the size of the set of constraints.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2019, 29, 1; 125-137
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A matrix inequality based design method for consensus problems in multi-agent systems
    Autorzy:
    Zhai, G.
    Okuno, S.
    Imae, J.
    Kobayashi, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/930012.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    system wieloagentowy
    konsensus
    sterowanie zdecentralizowane
    nierówność macierzy
    LMI
    multi-agent systems
    consensus
    decentralized control
    graph Laplacian
    matrix inequality
    Opis:
    In this paper, we study a consensus problem in multi-agent systems, where the entire system is decentralized in the sense that each agent can only obtain information (states or outputs) from its neighbor agents. The existing design methods found in the literature are mostly based on a graph Laplacian of the graph which describes the interconnection structure among the agents, and such methods cannot deal with complicated control specification. For this purpose, we propose to reduce the consensus problem at hand to the solving of a strict matrix inequality with respect to a Lyapunov matrix and a controller gain matrix, and we propose two algorithms for solving the matrix inequality. It turns out that this method includes the existing Laplacian based method as a special case and can deal with various additional control requirements such as the convergence rate and actuator constraints.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2009, 19, 4; 639-646
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies