Temat: GCD - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Composite Labelling of Graphs - II
Autorzy:: Karuppuswamy, Priyanka
Kureethara, Joseph Varghese
Powiązania:: https://bibliotekanauki.pl/articles/1177829.pdf
Data publikacji:: 2018
Wydawca:: Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:: Composite Labelling
GCD
Labelling of Graphs
Total Labelling
Opis:: Composite labelling is a bijective function from the set of all vertices and edges to the set of all natural numbers up to the sum of the number of all vertices and edges in a graph. In this paper, the composite labelling of the Cartesian and Tensor Products of paths, Corona of ismorphic cycles and generalised Petersen graph are explored.
Źródło:: World Scientific News; 2018, 99; 227-234
2392-2192
Pojawia się w:: World Scientific News
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm
Autorzy:: Ardhyamath, Poornima
Naghabhushana, N. M.
Ujjinimatad, Rohitha
Powiązania:: https://bibliotekanauki.pl/articles/1070857.pdf
Data publikacji:: 2019
Wydawca:: Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:: Euclidean Algorithm
Factorization
GCD
Quantum Fourier Transform
Shor’s Algorithm
Opis:: In this paper we focused on the factorization of integer in detail using well known Shor’s algorithm and its quantum part realization. The algorithm finds prime factors any integer more efficiently than any known classical algorithm. It is based on prior knowledge of the answer to the factorization problem. Algorithm includes finding gcd using polynomial time Euclidean algorithm, determination of unknown period from quantum computer and continued fraction expansion approach. Factorization of two integers 21 and 91 are shown in this paper with all steps. Quantum part of the factorization described mathematically.
Źródło:: World Scientific News; 2019, 123; 102-113
2392-2192
Pojawia się w:: World Scientific News
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Color energy of a unitary Cayley graph
Autorzy:: Adiga, Chandrashekar
Sampathkumar, E.
Sriraj, M.A.
Powiązania:: https://bibliotekanauki.pl/articles/31231988.pdf
Data publikacji:: 2014-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: coloring of a graph
unitary Cayley graph
gcd-graph
color eigenvalues
color energy
Opis:: Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al. [1] have introduced the concept of color energy of a graph Ec(G) and computed the color energy of few families of graphs with χ(G) colors. In this paper we derive explicit formulas for the color energies of the unitary Cayley graph Xn, the complement of the colored unitary Cayley graph $\overline{(Xn)c}$ and some gcd-graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 4; 707-721
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja