Temat: CUT - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Pairs of edges as chords and as cut-edges
Autorzy:: McKee, Terry A.
Powiązania:: https://bibliotekanauki.pl/articles/30148711.pdf
Data publikacji:: 2014-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: cycle
chord
cut-edge
Opis:: Several authors have studied the graphs for which every edge is a chord of a cycle; among 2-connected graphs, one characterization is that the deletion of one vertex never creates a cut-edge. Two new results: among 3-connected graphs with minimum degree at least 4, every two adjacent edges are chords of a common cycle if and only if deleting two vertices never creates two adjacent cut-edges; among 4-connected graphs, every two edges are always chords of a common cycle.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 4; 673-681
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Some results concerning the ends of minimal cuts of simple graphs
Autorzy:: Jia, Xiaofeng
Powiązania:: https://bibliotekanauki.pl/articles/743739.pdf
Data publikacji:: 2000
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: cut
fragment
end
interference
Opis:: Let S be a cut of a simple connected graph G. If S has no proper subset that is a cut, we say S is a minimal cut of G. To a minimal cut S, a connected component of G-S is called a fragment. And a fragment with no proper subset that is a fragment is called an end. In the paper ends are characterized and it is proved that to a connected graph G = (V,E), the number of its ends Σ ≤ |V(G)|.
Źródło:: Discussiones Mathematicae Graph Theory; 2000, 20, 1; 139-142
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Lower bounds for the domination number
Autorzy:: Delaviña, Ermelinda
Pepper, Ryan
Waller, Bill
Powiązania:: https://bibliotekanauki.pl/articles/744047.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: domination number
radius
matching
cut-vertices
Opis:: In this note, we prove several lower bounds on the domination number of simple connected graphs. Among these are the following: the domination number is at least two-thirds of the radius of the graph, three times the domination number is at least two more than the number of cut-vertices in the graph, and the domination number of a tree is at least as large as the minimum order of a maximal matching.
Źródło:: Discussiones Mathematicae Graph Theory; 2010, 30, 3; 475-487
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

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: 5.

Tytuł:: On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
Autorzy:: Wang, Dingguo
Shan, Erfang
Powiązania:: https://bibliotekanauki.pl/articles/30148001.pdf
Data publikacji:: 2014-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: 4-regular graph
claw-free
cut-vertices
end-blocks
Opis:: A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex. In this paper we establish upper bounds on the numbers of end-blocks and cut-vertices in a 4-regular graph G and claw-free 4-regular graphs. We characterize the extremal graphs achieving these bounds.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 1; 127-136
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 6.

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ł

Skocz do pozycji: 7.

Tytuł:: Some Observations on the Smallest Adjacency Eigenvalue of a Graph
Autorzy:: Cioabă, Sebastian M.
Elzinga, Randall J.
Gregory, David A.
Powiązania:: https://bibliotekanauki.pl/articles/31548045.pdf
Data publikacji:: 2020-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph spectrum
smallest eigenvalue
adjacency matrix
graph decomposition
clique partition
claw-free graphs
maximum cut
Opis:: In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are based on Rayleigh quotients, Cauchy interlacing using induced subgraphs, and Haemers interlacing with vertex partitions and quotient matrices. In this paper, we are interested in obtaining lower bounds for the smallest eigenvalue. Motivated by results on line graphs and generalized line graphs, we show how graph decompositions can be used to obtain such lower bounds.
Źródło:: Discussiones Mathematicae Graph Theory; 2020, 40, 2; 467-493
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja