Results 41 to 50 of about 5,965 (204)
Characterizing and Comparing Phylogenies from their Laplacian Spectrum [PDF]
AbstractPhylogenetic trees are central to many areas of biology, ranging from population genetics and epidemiology to microbiology, ecology, and macroevolution. The ability to summarize properties of trees, compare different trees, and identify distinct modes of division within trees is essential to all these research areas.
Lewitus, E., Morlon, H.
openaire +2 more sources
Signless Laplacian determinations of some graphs with independent edges
Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively.
R. Sharafdini, A.Z. Abdian
doaj +1 more source
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan +3 more
doaj +1 more source
Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, subdivision-edge join, R-vertex join, and R-edge join of two regular graphs in terms of the normalized Laplacian eigenvalues of the graphs.
Arpita Das, Pratima Panigrahi
doaj +2 more sources
On the sum of signless Laplacian spectra of graphs
For a simple graph $G(V,E)$ with $n$ vertices, $m$ edges, vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$ and edge set $E(G)=\{e_1, e_2,\dots, e_m\}$, the adjacency matrix $A=(a_{ij})$ of $G$ is a $(0, 1)$-square matrix of order $n$ whose $(i,j)$-entry is ...
S. Pirzada, H.A. Ganie, A.M. Alghamdi
doaj +1 more source
On the cozero-divisor graphs associated to rings
Let R be a ring with unity. The cozero-divisor graph of a ring R, denoted by [Formula: see text] is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of R, and two distinct vertices x and y are adjacent if and ...
Praveen Mathil +2 more
doaj +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
Concensus-Based ALADIN Method to Faster the Decentralized Estimation of Laplacian Spectrum
With the upcoming fifth Industrial Revolution, humans and collaborative robots will dance together in production. They themselves act as an agent in a connected world, understood as a multi-agent system, in which the Laplacian spectrum plays an important
Thi-Minh-Dung Tran +2 more
doaj +1 more source
Normalized Laplacian Spectrum of Some Q-Coronas of Two Regular Graphs
In this paper we determine the normalized Laplacian spectrum of the Q-vertex corona, Q-edge corona, Q-vertex neighborhood corona, and Q-edge neighborhood corona of a connected regular graph with an arbitrary regular graph in terms of normalized Laplacian
Das Arpita, Panigrahi Pratima
doaj +1 more source
Spectrum dan Spectrum Laplacian pada Graf Mahkota
Crown Crown () is a graph that has the number of vertices and the number of edges are with , integers. Suppose that are eigen values of a matrix and are the multiplicity of each , so the spectrum of a graph can be expressed as a matrix whose line elements are in the first row, and in the second row.
openaire +2 more sources

