EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 22 Next

Displaying 421 – 440 of 546

Spectra of expansion graphs.

Friedland, Shmuel, Schneider, Hans (1999)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Spectra of extended double cover graphs

Zhibo Chen (2004)

Czechoslovak Mathematical Journal

The construction of the extended double cover was introduced by N. Alon [1] in 1986. For a simple graph $G$ with vertex set $V = {v_{1}, v_{2}, \dots, v_{n}}$ , the extended double cover of $G$ , denoted $G^{*}$ , is the bipartite graph with bipartition $(X, Y)$ where $X = {x_{1}, x_{2}, \dots, x_{n}}$ and $Y = {y_{1}, y_{2}, \dots, y_{n}}$ , in which $x_{i}$ and $y_{j}$ are adjacent iff $i = j$ or $v_{i}$ and $v_{j}$ are adjacent in $G$ . In this paper we obtain formulas for the characteristic polynomial and the spectrum of $G^{*}$ in terms of the corresponding information of $G$ . Three formulas are derived for the number of spanning trees in $G^{*}$ for a connected...

Spectra of Regular Polytopes.

N.C. Saldanha, C. Tomei (1992)

Discrete & computational geometry

Spectra of weighted compound graphs of generalized Bethe trees.

Rojo, Oscar, Medina, Luis (2009)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Spectra of weighted rooted graphs having prescribed subgraphs at some levels.

Rojo, Oscar, Robbiano, Maria, Cardoso, Domingos M., Martins, Enide A. (2011)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Spectral characterization of multicone graphs

Jianfeng Wang, Haixing Zhao, Qiongxiang Huang (2012)

Czechoslovak Mathematical Journal

A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho's result [B. Zhou, H. H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph. Additionally,...

Spectral characterizations of dumbbell graphs.

Wang, Jianfeng, Belardo, Francesco, Huang, Qiongxiang, Marzi, Enzo M.Li (2010)

The Electronic Journal of Combinatorics [electronic only]

Spectral Characterizations of Line Graphs. Variations on the Theme

Dragoš Cvetković (1983)

Publications de l'Institut Mathématique

Spectral extrema for graphs: the Zarankiewicz problem.

Babai, László, Guiduli, Barry (2009)

The Electronic Journal of Combinatorics [electronic only]

Spectral graph theory and the inverse eigenvalue problem of a graph.

Hogben, Leslie (2005)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Spectral integral variation of trees

Yi Wang, Yi-Zheng Fan (2006)

Discussiones Mathematicae Graph Theory

In this paper, we determine all trees with the property that adding a particular edge will result in exactly two Laplacian eigenvalues increasing respectively by 1 and the other Laplacian eigenvalues remaining fixed. We also investigate a situation in which the algebraic connectivity is one of the changed eigenvalues.

Spectral radius and Hamiltonicity of graphs with large minimum degree

Vladimir Nikiforov (2016)

Czechoslovak Mathematical Journal

Let $G$ be a graph of order $n$ and $λ (G)$ the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in $G$ . One of the main results of the paper is the following theorem: Let $k \geq 2,$ $n \geq k^{...}$

Spectral Recognition of Graphs

Dragoš Cvetković (2012)

The Yugoslav Journal of Operations Research

Spectral saturation: inverting the spectral Turán theorem.

Nikiforov, Vladimir (2009)

The Electronic Journal of Combinatorics [electronic only]

Spectral study of alliances in graphs

Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta Almira (2007)

Discussiones Mathematicae Graph Theory

In this paper we obtain several tight bounds on different types of alliance numbers of a graph, namely (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the relationship between the alliance numbers of a graph and its algebraic connectivity, its spectral radius, and its Laplacian spectral radius.

Currently displaying 421 – 440 of 546

Previous Page 22 Next

Displaying 421 – 440 of 546

Spectra of expansion graphs.

Spectra of extended double cover graphs

Spectra of Regular Polytopes.

Spectra of weighted compound graphs of generalized Bethe trees.

Spectra of weighted rooted graphs having prescribed subgraphs at some levels.

Spectral characterization of multicone graphs

Spectral characterizations of dumbbell graphs.

Spectral Characterizations of Line Graphs. Variations on the Theme

Spectral extrema for graphs: the Zarankiewicz problem.

Spectral graph theory and the inverse eigenvalue problem of a graph.

Spectral integral variation of trees

Spectral radius and Hamiltonicity of graphs with large minimum degree

Spectral Recognition of Graphs

Spectral saturation: inverting the spectral Turán theorem.

Spectral study of alliances in graphs

Spectral Techniques in Complex Networks

Spectrally arbitrary tree sign patterns of order 4.

Spectrum of two new joins of graphs and infinite families of integral graphs

Star Complements and Maximal Exceptional Graphs

Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra.

Currently displaying 421 – 440 of 546