نتایج جستجو برای: vertex removable cycle‎

تعداد نتایج: 314605  

Journal: :caspian journal of mathematical sciences 2014
a. b‎. ‎ attar a. a‎. ‎ sangoor

‎in this paper we defined the vertex removable cycle in respect of the following‎, ‎if $f$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$g in f $‎, ‎the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $.‎ ‎the vertex removable cycles of eulerian graphs are studied‎. ‎we also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎

A. A‎. ‎ Sangoor A. B‎. ‎ Attar,

‎In this paper we defined the vertex removable cycle in respect of the following‎, ‎if $F$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$G in F $‎, ‎the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $.‎ ‎The vertex removable cycles of eulerian graphs are studied‎. ‎We also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎    

Journal: :caspian journal of mathematical sciences 2012
a.b. attar

in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...

In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

Journal: :bulletin of the iranian mathematical society 0
h. zhang school of mathematical science‎, ‎huaiyin normal university‎, 111 changjiang west road‎, ‎huaian‎, ‎jiangsu‎, 223300‎, ‎p‎. ‎r‎. ‎china.

the vertex arboricity $rho(g)$ of a graph $g$ is the minimum number of subsets into which the vertex set $v(g)$ can be partitioned so that each subset induces an acyclic graph‎. ‎a graph $g$ is called list vertex $k$-arborable if for any set $l(v)$ of cardinality at least $k$ at each vertex $v$ of $g$‎, ‎one can choose a color for each $v$ from its list $l(v)$ so that the subgraph induced by ev...

Journal: :Journal of Graph Theory 2003
Manoel Lemos James G. Oxley

Mader and Jackson independently proved that every 2-connected simple graph G with minimum degree at least four has a removable cycle, that is, a cycle C such that G\E(C) is 2-connected. This paper considers the problem of determining when every edge of a 2-connected graph G, simple or not, can be guaranteed to lie in some removable cycle. The main result establishes that if every deletion of tw...

Journal: :journal of algorithms and computation 0
d. jelodar university of tehran, department of algorithms and computation d. moazzami university of tehran, college of engineering, department of engineering science p. nasehpour university of tehran, college of engineering, department of engineering science

a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.

1980
BILL JACKSON

The lower bound on the length of 'removable' cycles in Theorem 1 is essentially best possible since there exist 2-connected simple graphs of minimum degree k whose longest 'removable' cycle has length k + i. Moreover, for the special case k = 4, we can construct 2-connected, 4-regular simple graphs whose longest 'removable' cycle has length four. The following counterexample which was independe...

Journal: :Int. J. Comput. Geometry Appl. 2006
Mattias Andersson Joachim Gudmundsson Christos Levcopoulos

We consider the problem of simplifying a planar triangle mesh using edge contractions, under the restriction that the resulting vertices must be a subset of the input set. That is, contraction of an edge must be made onto one of its adjacent vertices, which results in removing the other adjacent vertex. We show that if the perimeter of the mesh consists of at most five vertices, then we can alw...

Journal: :journal of algorithms and computation 0
p. jeyanthi research centre, department of mathematics, govindammal aditanar college for women, tiruchendur-628 215, tamil nadu, india. a. sudha department of mathematics, wavoo wajeeha women’s college of arts and science, kayalpatnam -628 204,tamil nadu, india.

a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید