Temat: regular signed graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On Regular Signed Graphs with Three Eigenvalues
Autorzy:: Anđelić, Milica
Koledin, Tamara
Stanić, Zoran
Powiązania:: https://bibliotekanauki.pl/articles/31534886.pdf
Data publikacji:: 2020-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: adjacency matrix
eigenvalue
regular signed graph
signed line graph
block design
Opis:: In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular. We also give some constructions and determine all the signed graphs with 3 eigenvalues, under the constraint that they are either signed line graphs or have vertex degree 3. We also report our result of computer search on those with at most 10 vertices.
Źródło:: Discussiones Mathematicae Graph Theory; 2020, 40, 2; 405-416
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: More on Signed Graphs with at Most Three Eigenvalues
Autorzy:: Ramezani, Farzaneh
Rowlinson, Peter
Stanić, Zoran
Powiązania:: https://bibliotekanauki.pl/articles/32222534.pdf
Data publikacji:: 2022-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: adjacency matrix
simple eigenvalue
strongly regular signed graph
vertex-deleted subgraph
weighing matrix
association scheme
Opis:: We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples using weighing matrices and symmetric 3-class association schemes.
Źródło:: Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1313-1331
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On composition of signed graphs
Autorzy:: Shahul Hameed, K.
Germina, K.
Powiązania:: https://bibliotekanauki.pl/articles/743222.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: signed graph
eigenvalues
graph composition
regular graphs
net-regular signed graphs
Opis:: A graph whose edges are labeled either as positive or negative is called a signed graph. In this article, we extend the notion of composition of (unsigned) graphs (also called lexicographic product) to signed graphs. We employ Kronecker product of matrices to express the adjacency matrix of this product of two signed graphs and hence find its eigenvalues when the second graph under composition is net-regular. A signed graph is said to be net-regular if every vertex has constant net-degree, namely, the difference of the number of positive and negative edges incident with a vertex. We also characterize balance in signed graph composition and have some results on the Laplacian matrices of this product.
Źródło:: Discussiones Mathematicae Graph Theory; 2012, 32, 3; 507-516
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja