نتایج جستجو برای: locating choromatic of graphs

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

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.

Journal: :iranian journal of mathematical chemistry 2011
m. tavakoli h. yousefi-azari

distance-balanced graphs are introduced as graphs in which every edge uv has the followingproperty: the number of vertices closer to u than to v is equal to the number of vertices closerto v than to u. basic properties of these graphs are obtained. in this paper, we study theconditions under which some graph operations produce a distance-balanced graph.

2012
Fengwei Li

The tenacity of an incomplete connected graph G is defined as T (G) = min{ |S|+m(G−S) ω(G−S) : S ⊂ V (G), ω(G− S) > 1}, where ω(G− S) and m(G− S), respectively, denote the number of components and the order of a largest component inG−S. This is a reasonable parameter to measure the vulnerability of networks, as it takes into account both the amount of work done to damage the network and how bad...

Journal: :Electr. Notes Theor. Comput. Sci. 2009
Ricardo Queiroz de Araujo Fernandes Edward Hermann Haeusler

Topoi are known to be categories with extra properties that make them much alike the category of Sets. In a Topoi it is possible to define adequate notions of membership, elements and subobjects, power ”sets”, and finally, every Topoi has an internal logic able to justify any reasoning carried inside it. Most of the cases, this logic is not Classical (Boolean). The general logic for the Topoi i...

2011
Sergeı̆ Sergeeva Edouard Wagneur

Article history: Available online 25 March 2011 Submitted by J.J. Loiseau AMS classification: 15A80 15A39 15A03

Journal: :transactions on combinatorics 2012
mehdi eliasi

the first ($pi_1$) and the second $(pi_2$) multiplicative zagreb indices of a connected graph $g$, with vertex set $v(g)$ and edge set $e(g)$, are defined as $pi_1(g) = prod_{u in v(g)} {d_u}^2$ and $pi_2(g) = prod_{uv in e(g)} {d_u}d_{v}$, respectively, where ${d_u}$ denotes the degree of the vertex $u$. in this paper we present a simple approach to order these indices for connected graphs on ...

Journal: :international journal of advanced design and manufacturing technology 0
sa'id golabi javad jafari fesharaki

using piezoelectric patches the stress concentration around a hole on a plate under tension is reduced and controlled. to attain the reduction in stress two placements for piezoelectric patches is investigated. the first location is top/bottom of the hole with compression induced strain and the second is left/right of the hole with tension induced strains to control the stress flow. the result ...

Journal: :ecopersia 2015
behnoush farokhzadeh behnaz attaeian davoud akhzari yousef razandi ommolbanin bazrafshan

constructionof underground dams is a practical solution to save groundwater in alluvium watersheds, particularly in arid and semi-arid regions where surface water scarcity is an environmental challenge. considering socio-economic and environmental benefits of underground dams, the accurate locating is the primary consideration for dam construction. the new technologies and methods are a step to...

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

Journal: :journal of algebra and related topics 2014
m. alaeiyan l. pourmokhtar m. k. hosseinpoor

a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

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

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