Temat: cut vertex - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: The signless Laplacian spectral radius of graphs with given number of cut vertices
Autorzy:: Cui, Lin
Fan, Yi-Zheng
Powiązania:: https://bibliotekanauki.pl/articles/744527.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph
cut vertex
signless Laplacian matrix
spectral radius
Opis:: 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.
Źródło:: Discussiones Mathematicae Graph Theory; 2010, 30, 1; 85-93
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: On the connectivity of the annihilating-ideal graphs
Autorzy:: Chelvam, T.
Selvakumar, K.
Powiązania:: https://bibliotekanauki.pl/articles/728900.pdf
Data publikacji:: 2015
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: annihilating-ideal graph
local ring
nilpotency
cut vertex
Opis:: Let R be a commutative ring with identity and *(R) the set of non-zero ideals with non-zero annihilators. The annihilating-ideal graph of R is defined as the graph (R) with the vertex set *(R) and two distinct vertices I₁ and I₂ are adjacent if and only if I₁I₂ = (0). In this paper, we examine the presence of cut vertices and cut sets in the annihilating-ideal graph of a commutative Artinian ring and provide a partial classification of the rings in which they appear. Using this, we obtain the vertex connectivity of some annihilating-ideal graphs.
Źródło:: Discussiones Mathematicae - General Algebra and Applications; 2015, 35, 2; 195-204
1509-9415
Pojawia się w:: Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Leaps: an approach to the block structure of a graph
Autorzy:: Mulder, Henry
Nebeský, Ladislav
Powiązania:: https://bibliotekanauki.pl/articles/743877.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: leap
leap operation
block
cut-vertex
block closure
block graph
Opis:: To study the block structure of a connected graph G = (V,E), we introduce two algebraic approaches that reflect this structure: a binary operation + called a leap operation and a ternary relation L called a leap system, both on a finite, nonempty set V. These algebraic structures are easily studied by considering their underlying graphs, which turn out to be block graphs. Conversely, we define the operation $+_G$ as well as the set of leaps $L_G$ of the connected graph G. The underlying graph of $+_G$, as well as that of $L_G$, turns out to be just the block closure of G (i.e., the graph obtained by making each block of G into a complete subgraph).
Źródło:: Discussiones Mathematicae Graph Theory; 2006, 26, 1; 77-90
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja