Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Order unicyclic graphs according to spectral radius of unoriented laplacian matrix

100%
Fan Y.-Z., Wu S.
Discussiones Mathematicae Graph Theory
|
2008
|
tom 28
|
nr 3
487-499
EN
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.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two

100%
Gong S.-C., Fan Y.-Z.
Discussiones Mathematicae Graph Theory
|
2007
|
tom 27
|
nr 1
69-82
EN
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most three Laplacian eigenvalues greater than two.
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Spectral integral variation of trees

100%
Wang Y., Fan Y.-Z.
Discussiones Mathematicae Graph Theory
|
2006
|
tom 26
|
nr 1
49-58
EN
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.
4
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

The signless Laplacian spectral radius of graphs with given number of cut vertices

100%
Cui L., Fan Y.-Z.
Discussiones Mathematicae Graph Theory
|
2010
|
tom 30
|
nr 1
85-93
EN
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.
5
Content available remote

Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges

81%
Fan Y.-Z., Tan Y.-Y., Peng X.-X., Liu A.-H.
Discussiones Mathematicae Graph Theory
|
2016
|
tom 36
|
nr 4
845-856
EN
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs, linear or power unicyclic hypergraphs with given girth, linear or power bicyclic hypergraphs, respectively.
6
Content available remote

The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic

81%
Wang Y., Fan Y.-Z., Li X.-X., Zhang F.-F.
Discussiones Mathematicae Graph Theory
|
2015
|
tom 35
|
nr 2
249-260
EN
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n/2 ). In this paper we discuss the minimizing graphs of a special class of graphs of order n whose complements are connected and contains exactly one cycle (namely the class Ucn of graphs whose complements are unicyclic), and characterize the unique minimizing graph in Ucn when n ≥ 20.
7
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On the second largest eigenvalue of a mixed graph

81%
Zhou J., Fan Y.-Z., Wang Y.
Discussiones Mathematicae Graph Theory
|
2007
|
tom 27
|
nr 2
373-384
EN
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ₂(G) and the second largest degree d₂(G), and present a sufficient condition for λ₂(G) ≥ d₂(G).
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.