نتایج جستجو

34971

نتیجه یافت شد

مرتبط ترین ها

اعمال فیلتر

به روزترین ها

اعمال فیلتر

پربازدید ترین ها

اعمال فیلتر

پر دانلودترین‌ها

اعمال فیلتر

پر استنادترین‌ها

اعمال فیلتر

تعداد صفحات

3498

انتقال به صفحه



فیلترها/جستجو در نتایج    

فیلترها

سال

بانک‌ها




گروه تخصصی











متن کامل


مرکز اطلاعات علمی SID1
مرکز اطلاعات علمی SID
اسکوپوس
مرکز اطلاعات علمی SID
ریسرچگیت
strs
نویسنده: 

MOJDEH DOOST ALI | YAZDANMEHR BAHAREH

اطلاعات دوره: 
  • سال: 

    2013
  • دوره: 

    0
  • شماره: 

    44
تعامل: 
  • بازدید: 

    1155
  • دانلود: 

    0
چکیده: 

ONE OF THE MOST IMPORTANT PROBLEMS IN GRAPH THEORY IS TO FIND THE dominating PARAMETERS WITH MINIMUM CARDINALITY.ALTHOUGH IT IS WELL KNOWN THAT, THESE PARAMETERS ARE NP-HARD. IN THIS NOTE WE WILL STUDY THE CONCEPTS OF TOTAL dominating setS AND TOTAL dominating POLYNOMIALS FROM VIEWPOINT LINEAR PROGRAMMING.

آمار یکساله:  

بازدید 1155

دانلود 0
نویسندگان: 

MATINFAR M. | MIRZAMANI S.

اطلاعات دوره: 
  • سال: 

    2008
  • دوره: 

    5
  • شماره: 

    19
  • صفحات: 

    43-45
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    14494
  • دانلود: 

    15025
چکیده: 

Let G is n− vertex graph. In 1996, Reed conjectured that g (G) £ [n/3] for every connected 3− regular G. In this paper, we introduce an algorithm in computer algebra system of MAPLE such that, by using any graph as input, we can calculate domination number g(G) and illustrated set of all dominating sets. It important that these sets choose among between (n g(G)) sets.

آمار یکساله:  

بازدید 14494

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

اطلاعات دوره: 
  • سال: 

    2015
  • دوره: 

    0
  • شماره: 

    46
تعامل: 
  • بازدید: 

    1155
  • دانلود: 

    0
چکیده: 

LET G= (V, E) BE A SIMPLE AND UNDIRECTED GRAPH. FOR SOME REAL NUMBER WITH 0<A 1, A set D ÍV IS CALLED AN-dominating set IN G IF EVERY VERTEX U OUTSIDE D HAS AT LEAST A .DU NEIGHBOR (S) IN S WHERE DV IS THE DEGREE OF U.

آمار یکساله:  

بازدید 1155

دانلود 0
گارگاه ها آموزشی
نویسنده: 

NALBANDEH NEGARESTANI YASHAR

اطلاعات دوره: 
  • سال: 

    2013
  • دوره: 

    0
  • شماره: 

    44
تعامل: 
  • بازدید: 

    1575
  • دانلود: 

    0
چکیده: 

IN THIS PAPER, WE PROVIDE A SERVICE BY MOVABLE SENSORS IN AD-HOC SENSOR NETWORKS WITHOUT ANY DISCONNECTING IN SERVICE.WE USE dominating set FOR THIS. A dominating set FOR GRAPH G IS A SUBset OF VERTICES SUCH THAT FOR ANY U Î V, EITHER U OR AT LEAST ONE NEIGHBOR OF U IS CONTAINED IN THE SUBset. DUE TO THE LIFETIME IN NODES, AND MOBILITY, THE NETWORKS TOPOLOGY CAN CHANGE OVER THE TIME, SO WE ARE LOOKING FOR SOME SITUATIONS THAT KEEP SERVICE IN THIS UNSAFE SITUATION. WE SHOW THAT IF THE NUMBER OF SERVERS BE AT LEAST [(N+1)/ 3], THEN BY REMOVING NODES FROM NETWORK WE CAN KEEP SERVICE IN WHOLE THE NETWORK WITHOUT ANY PROBLEM.

آمار یکساله:  

بازدید 1575

دانلود 0
نویسندگان: 

SAMODIVKIN VLADIMIR

اطلاعات دوره: 
  • سال: 

    2017
  • دوره: 

    6
  • شماره: 

    3
  • صفحات: 

    1-9
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    10797
  • دانلود: 

    3803
چکیده: 

Please click on PDF to view the abstract.

آمار یکساله:  

بازدید 10797

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

EBADI KARAM | MANRIQUE MARTIN

اطلاعات دوره: 
  • سال: 

    2013
  • دوره: 

    0
  • شماره: 

    44
تعامل: 
  • بازدید: 

    10710
  • دانلود: 

    0
چکیده: 

A set S ÍV IS A CO-SECURE dominating set (CSDS) OF A GRAPH G= (V, E) IF S IS A dominating set, AND FOR EACH U 2 S THERE EXISTS A VERTEX N Î V \ S SUCH THAT UNÎE AND (S\{U}) È {N} A dominating set. THE MINIMUM CARDINALITY OF A CO-SECURE dominating set IN G IS THE CO-SECURE DOMINATION NUMBER ¡CS (G) OF G: IN THIS PAPER WE INITIATE A STUDY OF THIS PARAMETER. WE PROVE THAT THE DECISION PROBLEM FOR THIS PARAMETER IS NP-COMPLETE EVEN WHEN RESTRICTED TO BIPARTITE, CHORDAL OR PLANAR GRAPHS.

آمار یکساله:  

بازدید 10710

دانلود 0
strs
اطلاعات دوره: 
  • سال: 

    2015
  • دوره: 

    0
  • شماره: 

    46
تعامل: 
  • بازدید: 

    1260
  • دانلود: 

    0
چکیده: 

THE CONCEPT OF MAJORITY DOMINATION IN GRAPHS HAS BEEN DEFINED IN AT LEAST TWO DIFFERENT WAYS: AS A FUNCTION AND AS A set. IN THIS WORK WE EXTEND THE LATTER CONCEPT TO DIGRAPHS, WHILE WE EXTENDED THE FORMER IN ANOTHER PAPER. GIVEN A DIGRAPH D= (V, A), A set SÍ V IS A MAJORITY OUT-dominating set (MODS) OF D IF (FORMULA). THE MINIMUM CARDINALITY OF A MAJORITY OUT-dominating set IN D IS THE set MAJORITY OUT-DOMINATION NUMBER ¡M+ (D) OF D. IN THIS WORK WE INTRODUCE THESE CONCEPTS AND PROVE SOME RESULTS ABOUT THEM, AMONG WHICH THE CHARACTERIZATION OF MINIMAL MODSS.

آمار یکساله:  

بازدید 1260

دانلود 0
نویسنده: 

ASSADI H. | BARTH M. | GREER A.L. | HERLACH D.M.

اطلاعات دوره: 
  • سال: 

    2015
  • دوره: 

    0
  • شماره: 

    46
تعامل: 
  • بازدید: 

    1470
  • دانلود: 

    0
چکیده: 

A ROMAN ENTIRE dominating FUNCTION ON A GRAPH G= (V, E) IS A FUNCTION H: Z= VÈE → {0, 1, 2} SATISFYING THE CONDITION THAT EACH ELEMENT X ∈ Z FOR WHICH H (X) =0 IS EITHER ADJACENT TO OR INCIDENT WITH AT LEAST ONE ELEMENT Y ∈ Z WITH H (Y) =2. THE WEIGHT OF A ROMAN ENTIRE dominating FUNCTION IS THE VALUE (FORMULA). THE ROMAN ENTIRE DOMINATION NUMBER OF A GRAPH G, DENOTED BY GREN (G), IS THE MINIMUM WEIGHT OF A ROMAN ENTIRE dominating FUNCTION ON G. IN THIS PAPER, WE OBTAIN SEVERAL BOUNDS FOR GREN (G). WE ALSO INVESTIGATE THE BEHAVIOR OF GREN (G) WHEN A VERTEX OR AN EDGE IS DELETED.

آمار یکساله:  

بازدید 1470

دانلود 0
نویسندگان: 

Cary Michael | Cary Jonathan | Prabhu Savari

اطلاعات دوره: 
  • سال: 

    2021
  • دوره: 

    6
  • شماره: 

    1
  • صفحات: 

    67-80
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    6021
  • دانلود: 

    5468
چکیده: 

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, trees, DAGs, cycles, and bipartite graphs. We also provide the idomatic number for special cases of some of these families of digraphs.

آمار یکساله:  

بازدید 6021

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

ALIKHANI SAEID

اطلاعات دوره: 
  • سال: 

    2016
  • دوره: 

    0
  • شماره: 

    47
تعامل: 
  • بازدید: 

    1890
  • دانلود: 

    0
چکیده: 

LET G= (V, E) BE A SIMPLE GRAPH. A set S &NBSP;Í V IS A dominating set IF EVERY VERTEX IN V \SIS ADJACENT TO AT LEAST ONE VERTEX IN S. THE DOMINATION NUMBER G IS THE MINIMUM CARDINALITY OF A dominating set IN G. A dominating set OF G WITH CARDINALITY G IS CALLED G-set OF G. IN THIS PAPER, WE COUNT THE NUMBER OF G-setS OF CARTESIAN PRODUCT OF G WITH COMPLETE GRAPHS.

آمار یکساله:  

بازدید 1890

دانلود 0
litScript