نتایج جستجو برای: super line graph
تعداد نتایج: 645048 فیلتر نتایج به سال:
ON SUPER EDGE-MAGIC TOTAL LABELING OF REFLEXIVE W-TREES Muhammad Imran, Mehar Ali Malik, M. Yasir Hayat Malik Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Islamabad, Pakistan. E-mail: {imrandhab, alies.camp, yasirmalikawan}@gmail.com Mathematics Subject Classification: 05C78 ABSTRACT. Kotzig and Rosa [17] defined a magic lab...
This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009. In fact, many problems discussed in these papers are generalized in this paper. Topics covered in this paper include: (1)What is a Smarandache System? (2)Vertex-Edge Labeled Graphs with Applications: (i)Smarandachely k-constrained labeling of a grap...
abstract background: a major problem of the first moments of childbirth, especially in “prolonged labor,” is perinatal asphyxia which necessitates neonatal resuscitation. this study aimed at evaluating the alert line of the partogram in recognizing the need for neonatal resuscitation 20–30 s after delivery. materials and methods: 140 full‑term pregnant women were kept under surveillance through...
We present the first super-linear lower bounds for natural graph problems in the CONGEST model, answering a long-standing open question. Specifically, we show that any exact computation of a minimum vertex cover or a maximum independent set requires Ω(n/ log n) rounds in the worst case in the CONGEST model, as well as any algorithm for χ-coloring a graph, where χ is the chromatic number of the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید