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.

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]

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.

scholarly journals Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs

1976 ◽  
Vol 19 (2) ◽  
pp. 169-172 ◽  
Author(s):  
Herbert Fleischner ◽  
Arthur M. Hobbs
Keyword(s):  
Sufficient Conditions ◽  
Unicyclic Graph ◽  
Necessary And Sufficient Conditions ◽  
Hamiltonian Cycles ◽  
Unicyclic Graphs ◽  
Necessary And Sufficient

In this paper we determine necessary and sufficient conditions for the square of a vertex-unicyclic graph to be Hamiltonian. The conditions are simple and easily checked. Further, we show that the square of a vertex-unicyclic graph is Hamiltonian if and only if it is vertex-pancyclic.

Graphs with cyclomatic number three having panconnected square

2017 ◽  
Vol 09 (05) ◽  
pp. 1750067
Author(s):  
G. L. Chia ◽  
W. Hemakul ◽  
S. Singhun
Keyword(s):  
Sufficient Conditions ◽  
Discrete Math ◽  
Necessary And Sufficient Conditions ◽  
Special Cases ◽  
Cyclomatic Number ◽  
Number Formula ◽  
Necessary And Sufficient ◽  
Hamiltonian Properties ◽  
Square Of A Graph

The square of a graph [Formula: see text] is the graph obtained from [Formula: see text] by adding edges joining those pairs of vertices whose distance from each other in [Formula: see text] is two. If [Formula: see text] is connected, then the cyclomatic number of [Formula: see text] is defined as [Formula: see text]. Graphs with cyclomatic number not more than [Formula: see text] whose square are panconnected have been characterized, among other things, in [G. L. Chia, S. H. Ong and L. Y. Tan, On graphs whose square have strong Hamiltonian properties, Discrete Math. 309 (2009) 4608–4613, G. L. Chia, W. Hemakul and S. Singhun, Graphs with cyclomatic number two having panconnected square, Discrete Math. 311 (2011) 850–855]. Here, we show that if [Formula: see text] has cyclomatic number [Formula: see text] and [Formula: see text] is panconnected, then [Formula: see text] is one of the eight families of graphs, [Formula: see text], defined in the paper. Further, we obtain necessary and sufficient conditions for three larger families of graphs (which contains [Formula: see text] as special cases) whose square are panconnected.

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.

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.

Nonlinear boundary-value problems for degenerate differential-algebraic systems

2020 ◽  
Vol 17 (3) ◽  
pp. 313-324
Author(s):  
Sergii Chuiko ◽  
Ol'ga Nesmelova
Keyword(s):  
Boundary Value Problem ◽  
Boundary Value Problems ◽  
Algebraic System ◽  
Boundary Value ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Weakly Nonlinear ◽  
Differential Algebraic System ◽  
Linear Differential ◽  
Necessary And Sufficient

The study of the differential-algebraic boundary value problems, traditional for the Kiev school of nonlinear oscillations, founded by academicians M.M. Krylov, M.M. Bogolyubov, Yu.A. Mitropolsky and A.M. Samoilenko. It was founded in the 19th century in the works of G. Kirchhoff and K. Weierstrass and developed in the 20th century by M.M. Luzin, F.R. Gantmacher, A.M. Tikhonov, A. Rutkas, Yu.D. Shlapac, S.L. Campbell, L.R. Petzold, Yu.E. Boyarintsev, V.F. Chistyakov, A.M. Samoilenko, O.A. Boichuk, V.P. Yacovets, C.W. Gear and others. In the works of S.L. Campbell, L.R. Petzold, Yu.E. Boyarintsev, V.F. Chistyakov, A.M. Samoilenko and V.P. Yakovets were obtained sufficient conditions for the reducibility of the linear differential-algebraic system to the central canonical form and the structure of the general solution of the degenerate linear system was obtained. Assuming that the conditions for the reducibility of the linear differential-algebraic system to the central canonical form were satisfied, O.A.~Boichuk obtained the necessary and sufficient conditions for the solvability of the linear Noetherian differential-algebraic boundary value problem and constructed a generalized Green operator of this problem. Based on this, later O.A. Boichuk and O.O. Pokutnyi obtained the necessary and sufficient conditions for the solvability of the weakly nonlinear differential algebraic boundary value problem, the linear part of which is a Noetherian differential algebraic boundary value problem. Thus, out of the scope of the research, the cases of dependence of the desired solution on an arbitrary continuous function were left, which are typical for the linear differential-algebraic system. Our article is devoted to the study of just such a case. The article uses the original necessary and sufficient conditions for the solvability of the linear Noetherian differential-algebraic boundary value problem and the construction of the generalized Green operator of this problem, constructed by S.M. Chuiko. Based on this, necessary and sufficient conditions for the solvability of the weakly nonlinear differential-algebraic boundary value problem were obtained. A typical feature of the obtained necessary and sufficient conditions for the solvability of the linear and weakly nonlinear differential-algebraic boundary-value problem is its dependence on the means of fixing of the arbitrary continuous function. An improved classification and a convergent iterative scheme for finding approximations to the solutions of weakly nonlinear differential algebraic boundary value problems was constructed in the article.

Sign in / Sign up

Export Citation Format

Share Document