نتایج جستجو برای: graph product

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

Journal: :Journal of applied mathematics & informatics 2016

Journal: :Algebraic structures and their applications 2019

Journal: :Discussiones Mathematicae Graph Theory 2019

Journal: :Proyecciones (Antofagasta) 2015

Journal: :Multimedia Tools and Applications 2022

Abstract Computer vision has established a foothold in the online fashion retail industry. Main product detection is crucial step of vision-based feed parsing pipelines, focused on identifying bounding boxes that contain being sold gallery images page. The current state-of-the-art approach does not leverage relations between regions image, and treats same independently, therefore fully exploiti...

Journal: :Sustainability 2021

Transformational computing paradigms, such as artificial intelligence, home automation, and the Internet of Things, are being rapidly applied to consumer electronics products, thus aiding in development integrated innovative features. Hence, ubiquitous electronic devices increasingly becoming essential everyday life. In this context, a wide gulf often exists between capabilities technical featu...

2000
Omer Reingold Salil P. Vadhan Avi Wigderson

The main contribution of this work is a new type of graph product, which we call the zig-zag product. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree from the small one, and its expansion properties from both! Iteration yields simple explicit constructions of constant-degree expanders of arbitrary size, startin...

1995
Samy A. Youssef SAMY A. YOUSSEF

In this paper, we have studied the connectedness of the graphs on the direct product of the Weyl groups. We have shown that the number of the connected components of the graph on the direct product of the Weyl groups is equal to the product of the numbers of the connected components of the graphs on the factors of the direct product. In particular, we show that the graph on the direct product o...

Journal: :Open journal of Discrete Mathematics 2021

A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs explain necessary sufficient conditions for construction cordial.

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

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