Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Martin, Bača"'
Publikováno v:
Discrete Mathematics Letters, Vol 13, Pp 111-116 (2024)
Externí odkaz:
https://doaj.org/article/c36133b523484a4fb70b12ea139da5fb
Publikováno v:
AIMS Mathematics, Vol 8, Iss 10, Pp 25249-25261 (2023)
Consider a simple graph $ G = (V, E) $ of size $ m $ with the vertex set $ V $ and the edge set $ E $. A modular edge-irregular total $ k $-labeling of a graph $ G $ is a labeling scheme for the vertices and edges with the labels $ 1, 2, \dots, k $ t
Externí odkaz:
https://doaj.org/article/ba2b434340ae47bb84da6ac65625e153
Publikováno v:
AIMS Mathematics, Vol 8, Iss 1, Pp 1475-1487 (2023)
For a simple graph G=(V,E) with the vertex set V(G) and the edge set E(G), a vertex labeling φ:V(G)→{1,2,…,k} is called a k-labeling. The weight of an edge under the vertex labeling φ is the sum of the labels of its end vertices and the modular
Externí odkaz:
https://doaj.org/article/1dc8fc2fe9894ca99c9f1abda0905b4e
Publikováno v:
Mathematics, Vol 11, Iss 24, p 4966 (2023)
Various methods are used when building bankruptcy prediction models. New sophisticated methods that are already used in other scientific fields can also be applied in this area. Graph theory provides a powerful framework for analyzing and visualizing
Externí odkaz:
https://doaj.org/article/aea35c06063f4a318fafb57aab598f7e
Autor:
Martin Bača
Publikováno v:
Historický Časopis, Vol 70, Iss 3, Pp 487-513 (2022)
BAČA, Martin. Ancient DNA, paleogenetics, cultural history and why historians should be interested. Historický časopis, 2022, 70, 3, pp. 487– 513, Bratislava. This paper advances understanding of the ancient genomics revolution of the last d
Externí odkaz:
https://doaj.org/article/792204b216004a53ab151306914467e6
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 761-770 (2020)
Let be a finite simple graph with p vertices and q edges. A decomposition of a graph G into isomorphic copies of a graph H is called (a, d)-H-antimagic if there is a bijection such that for all subgraphs isomorphic to H in the decomposition of G, the
Externí odkaz:
https://doaj.org/article/3d0dcbbc0de7495eac7e54e0aeaf413d
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 51-59 (2020)
For a graph we define -labeling such that the edges of are labeled with integers and the vertices of are labeled with even integers , where . The labeling is called a vertex irregular reflexive -labeling if distinct vertices have distinct weights, wh
Externí odkaz:
https://doaj.org/article/eb8accc945da48d9a8fc730944befbe4
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 213-219 (2020)
We investigate modifications of the well-known irregularity strength of graphs, namely, total (vertex, edge) -irregularity strengths. Recently the bounds and precise values for some families of graphs concerning these parameters have been determined.
Externí odkaz:
https://doaj.org/article/8815d877064140e6babb69e139434f54
Autor:
Gohar Ali, Martin Bača, Marcela Lascsáková, Andrea Semaničová-Feňovčíková, Ahmad ALoqaily, Nabil Mlaiki
Publikováno v:
AIMS Mathematics, Vol 8, Iss 4, Pp 7662-7661 (2023)
A (modular) vertex irregular total labeling of a graph G of order n is an assignment of positive integers from 1 to k to the vertices and edges of G with the property that all vertex weights are distinct. The vertex weight of a vertex v is defined as
Externí odkaz:
https://doaj.org/article/e18852ed55f94fdaad9217dba931e9fd
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 3, Pp 310-318 (2019)
For a simple graph with the vertex set and the edge set and for an integer , , an edge labeling induces a vertex labeling defined by , where are the edges incident to the vertex . The function is called a -total edge product cordial labeling of if fo
Externí odkaz:
https://doaj.org/article/ccbb6bb62e2e447684ab83acb3564eb1