Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Darren A Narayan"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 265-300 (2020)
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is uniform. I
Externí odkaz:
https://doaj.org/article/5836849bde7947ea9ed7f15fd3985a96
Publikováno v:
Mathematics, Vol 12, Iss 19, p 2994 (2024)
The combinatorial problem in this paper is motivated by a variant of the famous traveling salesman problem where the salesman must return to the starting point after each delivery. The total length of a delivery route is related to a metric known as
Externí odkaz:
https://doaj.org/article/c578605fed2a4487994dc40b223f964c
Publikováno v:
Mathematics, Vol 11, Iss 19, p 4068 (2023)
For a given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of vertices on which repeated applications of the forcing rule results in all vertices being included in S. The forcing rule is as follows: if a verte
Externí odkaz:
https://doaj.org/article/3e6d5b003db54036bb3e483b6aecfedf
Autor:
Josephine Brooks, Alvaro Carbonero, Joseph Vargas, Rigoberto Flórez, Brendan Rooney, Darren A. Narayan
Publikováno v:
Mathematics, Vol 11, Iss 6, p 1322 (2023)
A vertex in a graph is referred to as fixed if it is mapped to itself under every automorphism of the vertices. The fixing number of a graph is the minimum number of vertices, when fixed, that fixes all of the vertices in the graph. Fixing numbers we
Externí odkaz:
https://doaj.org/article/2e3586b5e437416a9628dd34594f3050
Publikováno v:
Mathematics, Vol 10, Iss 23, p 4463 (2022)
Given a graph G, the zero forcing number of G, Z(G), is the minimum cardinality of any set S of vertices of which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is: if a vertex v is in S, and exactly on
Externí odkaz:
https://doaj.org/article/5493151c405344e0b927495401c4a0cf
Publikováno v:
Symmetry, Vol 13, Iss 11, p 2221 (2021)
Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of vertices on which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is: if a vertex v is in S, and exactly o
Externí odkaz:
https://doaj.org/article/382ff62de0fa4047bba6ee5af930ca60
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 1, Pp 38-53 (2016)
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of G is define
Externí odkaz:
https://doaj.org/article/b42509a91f8b4a9c8e29e3d565a2d3f3
Autor:
Rigoberto Flórez, Darren A. Narayan
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 12, Iss 1, Pp 32-39 (2015)
A k-ranking is a vertex k-coloring with positive integers such that if two vertices have the same color any path connecting them contains a vertex of larger color. The rank number of a graph is smallest k such that G has a k-ranking. For certain grap
Externí odkaz:
https://doaj.org/article/a8cb4d804fb44b6eb12a0b27e2ce945a
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 12, Iss 1, Pp 1-13 (2015)
The distance d(i,j) between any two vertices i and j in a graph is the number of edges in a shortest path between i and j. If there is no path connecting i and j, then d(i,j)=∞. In 2001, Latora and Marchiori introduced the measure of efficiency bet
Externí odkaz:
https://doaj.org/article/635dbf02e3bd44268e51267d9e0c6fac
Autor:
Luke Rodriguez, Alejandra Brewer, Adam Gregory, Quindel Jones, Darren A. Narayan, Rigoberto Flórez
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 1000-1009 (2020)
A graph G is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability of a graph on n vertices being asymmetric tends to 1 as n tends to infinity. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6417246d191ec690de8bd69f062e983
https://doi.org/10.1016/j.akcej.2019.08.011
https://doi.org/10.1016/j.akcej.2019.08.011