scholarly journals The Structure of Locally Finite Two-Connected Graphs

10.37236/1211 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Carl Droms ◽  
Brigitte Servatius ◽  
Herman Servatius
Keyword(s):  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Locally Finite ◽  
Connected Graphs ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Necessary And Sufficient ◽  
Block Tree ◽  
Labeled Tree

We expand on Tutte's theory of $3$-blocks for $2$-connected graphs, generalizing it to apply to infinite, locally finite graphs, and giving necessary and sufficient conditions for a labeled tree to be the $3$-block tree of a $2$-connected graph.

Matchings in Countable Graphs

1977 ◽  
Vol 29 (1) ◽  
pp. 165-168 ◽  
Author(s):  
K. Steffens
Keyword(s):  
Perfect Matching ◽  
Sufficient Conditions ◽  
Finite Graph ◽  
Necessary And Sufficient Conditions ◽  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Arbitrary Graphs ◽  
Necessary And Sufficient

Tutte [9] has given necessary and sufficient conditions for a finite graph to have a perfect matching. Different proofs are given by Brualdi [1] and Gallai [2; 3]. The shortest proof of Tutte's theorem is due to Lovasz [5]. In another paper [10] Tutte extended his conditions for a perfect matching to locally finite graphs. In [4] Kaluza gave a condition on arbitrary graphs which is entirely different from Tutte's.

Matchings in Arbitrary Graphs

1971 ◽  
Vol 69 (3) ◽  
pp. 401-407 ◽  
Author(s):  
R. A. Brualdi
Keyword(s):  
Perfect Matching ◽  
Sufficient Conditions ◽  
Finite Graph ◽  
Maximum Cardinality ◽  
Original Proof ◽  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Arbitrary Graphs ◽  
Necessary And Sufficient

1. Tutte(10) has given necessary and sufficient conditions in order that a finite graph have a perfect matching. A different proof was given by Gallai(4). Berge(1) (and Ore (7)) generalized Tutte's result by determining the maximum cardinality of a matching in a finite graph. In his original proof Tutte used the method of skew symmetric determinants (or pfaffians) while Gallai and Berge used the much exploited method of alternating paths. Another proof of Berge's theorem, along with an efficient algorithm for constructing a matching of maximum cardinality, was given by Edmonds (2). In another paper (12) Tutte extended his conditions for a perfect matching to locally finite graphs.

Joins of paths and cycles of equal order with sigma chromatic number 2

2021 ◽  
pp. 2250006
Author(s):  
Agnes D. Garciano ◽  
Maria Czarina T. Lagura ◽  
Reginaldo M. Marcelo
Keyword(s):  
Chromatic Number ◽  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Odd Cycle ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Simple Connected Graph

For a simple connected graph [Formula: see text] let [Formula: see text] be a coloring of [Formula: see text] where two adjacent vertices may be assigned the same color. Let [Formula: see text] be the sum of colors of neighbors of any vertex [Formula: see text] The coloring [Formula: see text] is a sigma coloring of [Formula: see text] if for any two adjacent vertices [Formula: see text] [Formula: see text] The least number of colors required in a sigma coloring of [Formula: see text] is the sigma chromatic number of [Formula: see text] and is denoted by [Formula: see text] A sigma coloring of a graph is a neighbor-distinguishing type of coloring and it is known that the sigma chromatic number of a graph is bounded above by its chromatic number. It is also known that for a path [Formula: see text] and a cycle [Formula: see text] where [Formula: see text] [Formula: see text] and [Formula: see text] if [Formula: see text] is even. Let [Formula: see text] the join of the graphs [Formula: see text], where [Formula: see text] or [Formula: see text] [Formula: see text] and [Formula: see text] is not an odd cycle for any [Formula: see text]. It has been shown that if [Formula: see text] for [Formula: see text] and [Formula: see text] then [Formula: see text]. In this study, we give necessary and sufficient conditions under which [Formula: see text] where [Formula: see text] is the join of copies of [Formula: see text] and/or [Formula: see text] for the same value of [Formula: see text]. Let [Formula: see text] and [Formula: see text] be positive integers with [Formula: see text] and [Formula: see text] In this paper, we show that [Formula: see text] if and only if [Formula: see text] or [Formula: see text] is odd, [Formula: see text] is even and [Formula: see text]; and [Formula: see text] if and only if [Formula: see text] is even and [Formula: see text] We also obtain necessary and sufficient conditions on [Formula: see text] and [Formula: see text], so that [Formula: see text] for [Formula: see text] where [Formula: see text] or [Formula: see text] other than the cases [Formula: see text] and [Formula: see text]

Ends of graphs

1992 ◽  
Vol 111 (2) ◽  
pp. 255-266 ◽  
Author(s):  
Rgnvaldur G. Mller
Keyword(s):  
Automorphism Groups ◽  
Locally Finite ◽  
Connected Graphs ◽  
Finite Graphs ◽  
Locally Finite Graphs

AbstractIt is shown how questions about ends of locally finite graphs can be reduced to questions about trees. Several applications are given; for example, locally finite connected graphs with infinitely many ends and automorphism groups that act transitively on the ends are classified.

scholarly journals Two remarks on amalgams of locally finite groups

1987 ◽  
Vol 36 (3) ◽  
pp. 461-468 ◽  
Author(s):  
Berthold J. Maier
Keyword(s):  
Finite Group ◽  
Finite Index ◽  
Finite Groups ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Locally Finite Group ◽  
Locally Finite ◽  
Locally Finite Groups ◽  
The Common ◽  
Necessary And Sufficient

We construct non amalgamation bases in the class of locally finite groups, and we present necessary and sufficient conditions for the embeddability of an amalgam into a locally finite group in the case that the common subgroup has finite index in both constituents.

scholarly journals Infinite groups admitting a faithful irreducible representation

2018 ◽  
Vol 17 (01) ◽  
pp. 1850005
Author(s):  
Fernando Szechtman ◽  
Anatolii Tushev
Keyword(s):  
Irreducible Representation ◽  
Finite Groups ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Infinite Groups ◽  
Locally Finite ◽  
Locally Finite Groups ◽  
Necessary And Sufficient

Necessary and sufficient conditions for a group to possess a faithful irreducible representation are investigated. We consider locally finite groups and groups whose socle is essential.

Some Generalized Theorems on Connectivity

1960 ◽  
Vol 12 ◽  
pp. 546-554 ◽  
Author(s):  
R. E. Nettleton
Keyword(s):  
Chromatic Number ◽  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Dense Subgraphs ◽  
Special Cases ◽  
Necessary And Sufficient ◽  
Relationship Of ◽  
The Relationship

The “k-dense” subgraphs of a connected graph G are connected and contain neighbours of all but at most k-1 points. We consider necessary and sufficient conditions that a point be in Γk, the union of the minimal k-dense subgraphs. It is shown that Γk contains all the [m, k]-isthmuses” and [m, k]-articulators“— minimal subgraphs which disconnect the graph into at least k + 1 disjoint graphs—and that an [m, k]-isthmus or [m, k]-articulator of Γk disconnects G. We define “central points,” “degree” of a point, and “chromatic number” and examine the relationship of these concepts to connectivity. Many theorems contain theorems previously proved (1) as special cases.

scholarly journals Hamiltonian Cycles in the Square of a Graph

10.37236/690 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Jan Ekstein
Keyword(s):  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Hamiltonian Cycles ◽  
Block Graph ◽  
Cut Vertex ◽  
Necessary And Sufficient ◽  
Square Of A Graph

We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a cut vertex and any two these vertices are at distance at least four.

scholarly journals Topological Circles and Euler Tours in Locally Finite Graphs

10.37236/129 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Agelos Georgakopoulos
Keyword(s):  
Connected Graph ◽  
Simple Fact ◽  
Locally Finite ◽  
Finite Graphs ◽  
Continuous Map ◽  
Locally Finite Graphs ◽  
Euler Tour ◽  
Euler Tours

We obtain three results concerning topological paths ands circles in the end compactification $|G|$ of a locally finite connected graph $G$. Confirming a conjecture of Diestel we show that through every edge set $E\in {\cal C}$ there is a topological Euler tour, a continuous map from the circle $S^1$ to the end compactification $|G|$ of $G$ that traverses every edge in $E$ exactly once and traverses no other edge. Second, we show that for every sequence $(\tau_i)_{i\in \Bbb N}$ of topological $x$–$y$ paths in $|G|$ there is a topological $x$–$y$ path in $|G|$ all of whose edges lie eventually in every member of some fixed subsequence of $(\tau_i)$. It is pointed out that this simple fact has several applications some of which reach out of the realm of $|G|$. Third, we show that every set of edges not containing a finite odd cut of $G$ extends to an element of $\cal C$.

The extinction time of a general birth and death process with catastrophes

1986 ◽  
Vol 23 (04) ◽  
pp. 851-858 ◽  
Author(s):  
P. J. Brockwell
Keyword(s):  
Laplace Transform ◽  
Size Distribution ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Death Process ◽  
Extinction Time ◽  
Birth And Death Process ◽  
Different Types ◽  
The Laplace Transform ◽  
Necessary And Sufficient

The Laplace transform of the extinction time is determined for a general birth and death process with arbitrary catastrophe rate and catastrophe size distribution. It is assumed only that the birth rates satisfyλ0= 0,λj> 0 for eachj> 0, and. Necessary and sufficient conditions for certain extinction of the population are derived. The results are applied to the linear birth and death process (λj=jλ, µj=jμ) with catastrophes of several different types.

Sign in / Sign up

Export Citation Format

Share Document