Results 1 to 10 of about 63,515 (119)
Span of a Graph: Keeping the Safety Distance [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Inspired by Lelek's idea from [Disjoint mappings and the span of spaces, Fund. Math. 55 (1964), 199 -- 214], we introduce the novel notion of the span of graphs.
Iztok Banič, Andrej Taranenko
doaj +1 more source
Radio Number for Friendship Communication Networks
Mathematics, 2023 This paper investigates the radio labeling of friendship networks (F3,k, F4,k, F5,k, and F6,k). In contrast, a mathematical model is proposed for determining the upper bound of radio numbers for (F3,k, F4,k, F5,k, and F6,k).
Ahmad H. Alkasasbeh +3 more
doaj +1 more source
Total coloring conjecture on certain classes of product graphs
Electronic Journal of Graph Theory and Applications, 2023 A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no adjacent vertices and edges receive the same color.
Kanagasabapathi Somasundaram +2 more
doaj +1 more source
Deriving graphs with a retracting-free bidirectional double tracing
Electronic Journal of Graph Theory and Applications, 2022 A retracting-free bidirectional double tracing in a graph G is a closed walk which traverses every edge exactly once in each direction and such that no edge is succeeded by the same edge in the opposite direction.
Vladimir R. Rosenfeld
doaj +1 more source
Degree sum adjacency polynomial of standard graphs and graph operations
Electronic Journal of Graph Theory and Applications, 2022 In this paper we explore the characteristic polynomials of degree sum adjacency matrix DSA(G) of a simple undirected graph G. We state a relation between the structure of a graph with the coefficients of its DSA polynomial.
S S Shinde +3 more
doaj +1 more source
Some classes of trees with maximum number of holes two
AKCE International Journal of Graphs and Combinatorics, 2020 An -coloring of a simple connected graph is an assignment of non-negative integers to the vertices of such that adjacent vertices color difference is at least two, and vertices that are at distance two from each other get different colors.
Srinivasa Rao Kola +2 more
doaj +1 more source
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 An L(2, 1)-coloring (or labeling) of a graph G is a mapping [Formula: see text] such that [Formula: see text] if [Formula: see text] and [Formula: see text] if [Formula: see text] The span of an L(2, 1)-coloring is the maximum color assigned by it.
Nibedita Mandal, Pratima Panigrahi
doaj +1 more source
Interlace polynomials of 4n-snowflake graphs
Electronic Journal of Graph Theory and Applications, 2023 In this paper, we study the interlace polynomial of a special graph with n vertices, called 4n-snowflake graph. It is similar as the friendship graph Fn of n vertices, which is made of n 3-cycles sharing one center vertex.
Jyoti Champanerkar, Aihua Li
doaj +1 more source
On the inverse graph of a finite group and its rainbow connection number
Electronic Journal of Graph Theory and Applications, 2023 A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is called the rainbow ...
Rian Febrian Umbara +2 more
doaj +1 more source
Zonal graphs of small cycle rank
Electronic Journal of Graph Theory and Applications, 2023 A zonal labeling of a plane graph G is an assignment of the two nonzero elements of the ring Z3 of integers modulo 3 to the vertices of G such that the sum of the labels of the vertices on the boundary of each region of G is the zero element of Z3.
Andrew Bowling, Ping Zhang
doaj +1 more source