The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices which are called required. If the edge weights are allâ€¦ (More)

The edge-tenacity Te(G) of a graph G was defined as Te(G) = min FâŠ‚E(G) {| F | +Ï„(Gâˆ’ F ) Ï‰(Gâˆ’ F ) } where the minimum is taken over all edge cutset F of G. We define G-F to be the graph induced by theâ€¦ (More)

2017 Iranian Conference on Electrical Engineeringâ€¦

2017

Nowadays, striking growth of online social media has led to easier and faster spreading of rumors on cyber space, in addition to tradition ways. In this paper, rumor detection on Persian Twitterâ€¦ (More)

Many problems can be presented in an abstract form through a wide range of binary objects and relations which are defined over problemâ€™s domain. In these problems, graphical demonstration of definedâ€¦ (More)

The first-order edge-tenacity T1(G) of a graph G is defined as T1(G) = min î´ž |X | + Ï„(G âˆ’ X) Ï‰(G âˆ’ X) âˆ’ 1 î´£ where the minimum is taken over every edge-cutset X that separates G into Ï‰(G âˆ’ X)â€¦ (More)

A new lower bound on the tenacity ( ) T G of a graph G in terms of its connectivity ( ) G Îº and genus ( ) G Î³ is obtained. The lower bound and interrelationship involving tenacity and other wellknownâ€¦ (More)