نتایج جستجو برای: induced matching number

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

Journal: :Journal of Mathematical and Fundamental Sciences 2020

Journal: :International Journal of Computer Applications 2015

Journal: :International Journal of Pure and Apllied Mathematics 2013

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

2007
Mohammad R. Salavatipour

A matching M in a graph is called induced if there is no edge in the graph connecting two edges of M. The strong edge coloring problem is to nd an edge coloring of a given graph with minimum number of colors such that each color class is an induced matching. This problem is known to be NP-complete, even in very restricted cases. Here, we show that it can be solved in polynomial time on graphs w...

Journal: :amirkabir international journal of modeling, identification, simulation & control 2015
samira babalou mohammad javad kargar seyyed hashem davarpanah

ontology is the main infrastructure of the semantic web which provides facilities for integration, searching and sharing of information on the web. development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. by emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

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

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