نتایج جستجو برای: locating coloring

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

Journal: :Journal of Physics: Conference Series 2021

Let G = (V(G), E(G)) be a connected graph and is coloring of G. Π {C1, C2, ...,Ck}, where Ci the partition vertex in which colored i with 1 ≥ k. The representation v for called color code, denoted CΠ(v) ordered pair k-element namely, (d(v, C1), d(v, C2), ..., Ck)), Ci)= mind{d(v, x)|xεCi} If every have different c locating coloring. minimum number colors used chromatic locating, notated by XL(G...

Journal: :Emerging science journal 2023

Locating the rainbow connection number of graphs is a new mathematical concept that combines concepts vertex coloring and partition dimension. In this research, we determine lower upper bounds locating graph provide characterization with equal to its restrict graph. We also found trees regular bipartite graphs. The method used in study deductive begins literature related relevant previous resea...

Journal: :journal of industrial engineering, international 2007
m.a gutiérrez-andrade p lara-velázquez s.g de-los-cobos-silva

the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...

Journal: :iranian journal of radiation research 0
j. k. kim advanced radiation technology institute, korea atomic energy research institute, jeongeup 580-185, republic of korea m. k. kim department of food science and human nutrition, chonbuk national university, 567 baekjedaero, deokjin-gu, jeonju-si, chonbuk, 54896, republic of korea k. g. lee department of food science and biotechnology, dongguk university-seoul campus, 32, dongguk-ro, ilsandong-gu, goyang-si, 410-820, south korea

4-methylimidazole (4-mei) is a simple nitrogen-containing heterocyclic compound, and recently classified as group 2b by international agency for research on cancer (iarc). caramel coloring is widely applied food coloring in many food products including coffee, carbonated beverages, beer and wine. in present study, ɣ-irradiation was applied to caramel color iii to reduce the level of 4-mei witho...

J. K. Kim, K. G. Lee, M. K. Kim,

4-Methylimidazole (4-MEI) is a simple nitrogen-containing heterocyclic compound, and recently classified as group 2B by International Agency for Research on Cancer (IARC). Caramel coloring is widely applied food coloring in many food products including coffee, carbonated beverages, beer and wine. In present study, ɣ-irradiation was applied to Caramel Color III to reduce the level of 4-MEI witho...

Journal: :bulletin of the iranian mathematical society 2012
x. zhang g. liu j. l. wu

a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...

1988
Peter Clark

The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...

1988
Peter Clark

The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...

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

در این پایان نامه دو مقاله زیر بررسی شده اند، که اولی در مورد رنگ آمیزی موقعیت یاب و عدد رنگی موقعیت یاب گراف ها است و دیگری همه ی درخت های با عدد رنگی موقعیت یابی 3 را مشخص می کند. همچنین در این پایان نامه عدد رنگی موقعیت یاب گراف های مسیر، دور، کامل، دوبخشی، ستاره ها، درخت های دو ستاره و کاترپیلارها را مشخص می کند.

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

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