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

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - دانشکده ادبیات و علوم انسانی 1390

this study explored reading strategy use of tefl ma students when they read academic research articles in english. the purpose of this study was to investigate how this group of readers typically approaches reading academic research articles related to their field of study, and also what they do in reading such research articles. the aim of the present study was bilateral. first, the researcher...

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده ادبیات و علوم انسانی دکتر علی شریعتی 1393

the purpose of the present study was to investigate the relationship between fear of negative evaluation (fne) and communication strategies (css) among iranian efl learners. it was aimed to examine the differences in the use of communication strategies between speakers with high or low degree of fear of negative evaluation. the current study was a case study consisting of 10 english learners at...

2010
Hannah Nola Thompson Hannah Thompson

............................................................................................................................................ 2 ACKNOWLEDGEMENTS ....................................................................................................................... 4 CONTENTS .............................................................................................................

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید مدنی آذربایجان - دانشکده ادبیات و علوم انسانی 1393

abstract over the past two decades, applied linguists and language teachers have shown a great deal of interest in genre-centered approaches , mainly because of pedagogic concerns . this has been due to the need to help non-native readers enhance their ability to understand academic and scientific texts. following swales’ (1981) works on genre analysis, studies of different sections of resear...

A. Kaveh, K. Biabani Hamedani,

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

Journal: :journal of algorithms and computation 0
r. ponraj department of mathematics, sri paramakalyani college,alwarkurichi-627412, india rajpal singh research scholar, department of mathematics manonmaniam sundaranar university, tirunelveli-627012, india s. sathish narayanan department of mathematics, sri paramakalyani college,alwarkurichi-627412, india

let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه زنجان - دانشکده علوم ریاضی 1391

فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اراک - دانشکده علوم انسانی 1389

this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...

Journal: :transactions on combinatorics 2013
asma hamzeh ali iranmanesh mohammad ali hosseinzadeh samaneh hossein-zadeh

the hosoya index and the merrifield-simmons index are two types of graph invariants used in mathematical chemistry. in this paper, we give some formulas for computed these indices for some classes of corona product and link of two graphs. furthermore, we obtain exact formulas of hosoya and merrifield-simmons indices for the set of bicyclic graphs, caterpillars and dual star.

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

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