Results 31 to 40 of about 2,691 (126)
Inertias of Laplacian matrices of weighted signed graphs
Special Matrices, 2019 We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia.
Monfared K. Hassani +3 more
doaj +1 more source
Acta Universitatis Sapientiae: Informatica, 2020 Given a graph G = (V, E), with respect to a vertex partition š« we associate a matrix called š«-matrix and define the š«-energy, Eš« (G) as the sum of š«-eigenvalues of š«-matrix of G.
Joshi Prajakta Bharat, Joseph Mayamma
doaj +1 more source
Signless Laplacian energy of a first KCD matrix
Acta Universitatis Sapientiae: Informatica, 2022 The concept of first KCD signless Laplacian energy is initiated in this article. Moreover, we determine first KCD signless Laplacian spectrum and first KCD signless Laplacian energy for some class of graphs and their complement.
Mirajkar Keerthi G., Morajkar Akshata
doaj +1 more source
More on the minimum skew-rank of graphs
, 2015 The minimum (maximum) skew-rank of a simple graph G over real field is the smallest (largest) possible rank among all skew-symmetric matrices over real field whose i j -th entry is nonzero whenever viv j is an edge in G and is zero otherwise.
Hui Qu, Guihai Yu, Linhua Feng
semanticscholar +1 more source
Enumeration of spanning trees in the sequence of DĆ¼rer graphs
Open Mathematics, 2017 In this paper, we calculate the number of spanning trees in the sequence of DĆ¼rer graphs with a special feature that it has two alternate states. Using the electrically equivalent transformations, we obtain the weights of corresponding equivalent graphs ...
Li Shixing
doaj +1 more source
Numerical radius and zero pattern of matrices [PDF]
, 2007 We give tight upper bounds on the numerical range of square matrices in terms of their Frobenius (Euclidian) norm and a combinatorial parameter similar to the clique number of graphs.
BollobƔs +7 more
core +3 more sources
Some inequalities on the skew-spectral radii of oriented graphs
, 2012 Let G be a simple graph and GĻ be an oriented graph obtained from G by assigning a direction to each edge of G. The adjacency matrix of G is A(G) and the skew-adjacency matrix of GĻ is S(GĻ).
Guang-Hui Xu
semanticscholar +1 more source
Further results regarding the degree Kirchhoff index of graphs
, 2014 Let G be a connected graph with vertex set V.G/. The degree Kirchhoff index of G is defined as S .G/D P fu;vg V.G/ d.u/d.v/R.u;v/, where d.u/ is the degree of vertex u, and R.u;v/ denotes the resistance distance between vertices u and v. In this paper we
Lihua Feng, Guihai Yu, Weijun Liu
semanticscholar +1 more source
Graph isomorphism and Gaussian boson sampling
Special Matrices, 2021 We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties are then probed ...
BrƔdler Kamil +4 more
doaj +1 more source
A spectral condition for odd cycles in graphs [PDF]
, 2007 We give a sharp spectral condition for the existence of odd cycles in a graph of given order. We also prove a related stability result.Comment: The main theorem is improved.
Nikiforov, Vladimir
core +3 more sources