• 대한수학회지
• /
• 제42권4호
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.

• 대한수학회보
• /
• 제54권6호
• /
• pp.1873-1882
• /
• 2017

We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of q-partite graphs of given order, size and number of connected components.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.537-543
• /
• 2005

A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper Sallee's result is extended to 3-connected infinite locally finite VAP-free plane graphs containing no unbounded faces.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.83-93
• /
• 2006

A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper, by characterizing the circuit graphs and investigating the structure of LV-graphs, we extend his result to 3-connected infinite locally finite VAP-free plane graphs.

• 대한수학회논문집
• /
• 제11권1호
• /
• pp.1-21
• /
• 1996

In this paper the existence of spanning 3-trees in every 3-connected locally finite vertex-accumulation-point-free planer graph is verified, which is an extension of D. Barnette to infinite graphs and which improves the result of the author.

• Korean Journal of Mathematics
• /
• 제31권4호
• /
• pp.505-519
• /
• 2023

Let G = (V, E) be a graph. A subset S of V is called a dominating set of G if every vertex not in S is adjacent to some vertex in S. The domination number γ(G) of G is the minimum cardinality taken over all dominating sets of G. A dominating set S is called a connected dominating set if the subgraph induced by S is connected. The minimum cardinality taken over all connected dominating sets of G is called the connected domination number of G, and is denoted by γ_c(G). In this paper, we investigate the Nordhaus-Gaddum type results for the connected domination number and its derived graphs like line graph, subdivision graph, power graph, block graph and total graph, and characterize the extremal graphs.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.577-587
• /
• 2006

We present several properties concerning infinite maximal planar graphs. Results related to the infinite VAP-free planar graphs are also included. Finally, we extend the result of W. Goddard, who showed that every finite 4-connected maximal planar graph is 4-ordered, to infinite strong triangulations.

• 대한수학회보
• /
• 제52권4호
• /
• pp.1169-1183
• /
• 2015

We describe generalized Cayley graphs of rectangular groups, so that we obtain (1) an equivalent condition for two Cayley graphs of a rectangular group to be isomorphic to each other, (2) a necessary and sufficient condition for a generalized Cayley graph of a rectangular group to be (strong) connected, (3) a necessary and sufficient condition for the colour-preserving automorphism group of such a graph to be vertex-transitive, and (4) a sufficient condition for the automorphism group of such a graph to be vertex-transitive.

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.727-734
• /
• 1999

Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.531-539
• /
• 2009

In this paper we first present a structure theorem for an infinite locally finite 3-connected VAP-free planar graph, and in connection with this result we study a possible classification of infinite locally finite planar graphs by reducing modulo finiteness.