Results 61 to 70 of about 258 (128)
An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index
Discussiones Mathematicae Graph Theory, 2020 A total k-weighting f of a graph G is an assignment of integers from the set {1, . . . , k} to the vertices and edges of G. We say that f is neighbor expanded sum distinguishing, or NESD for short, if Σw∈N(v) (f(vw) + f(w)) differs from Σw∈N(u)(f(uw) + f(
Vučković Bojan
doaj +1 more source
Note on group irregularity strength of disconnected graphs
Open Mathematics, 2018 We investigate the group irregularity strength (sg(G)) of graphs, i.e. the smallest value of s such that taking any Abelian group 𝓖 of order s, there exists a function f : E(G) → 𝓖 such that the sums of edge labels at every vertex are distinct. So far it
Anholcer Marcin +3 more
doaj +1 more source
More on the Minimum Size of Graphs with Given Rainbow Index
Discussiones Mathematicae Graph Theory, 2020 The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand et al., is a natural generalization of the rainbow connection number of a graph.
Zhao Yan
doaj +1 more source
Extended Keller Graph and its properties
, 2019 In the paper extended Keller graph Γ3d is defined and some of its properties, such as Hamiltonian, the independence number, the chromatic number, etc.,are proved. Moreover, the size of a maximum clique of Γ3d for d = 2, 3, 4 and d ≥ 8 is given and for d =
Lysakowska, Magdalena
core
Group magicness of complete n-partite graphs
, 2008 Let A be a non-trivial Abelian group. We call a graph G = (V, E) A-magic if there exists a labeling f: E → A ∗ such that the induced vertex set labeling f +: V → A, defined by f + (v) = uv∈E f(uv) is a constant map. In this paper, we show that Kk1,k2,.
Richard M. Low, W. C. Shiu
core
Edge-face total chromatic number of 3-regular Halin graphs, Congressus Numerantium
, 2000 A Halin graph is a plane graph H = T ∪ C, where T is a plane tree with no vertex of degree two and at least one vertex of degree three or more, and C is a cycle connecting the end vertices of T in the cyclic order determined by a plane embedment of T. In
Wai Chee Shiu +3 more
core
Sum-List Colouring of Unions of a Hypercycle and a Path with at Most Two Vertices in Common
Discussiones Mathematicae Graph Theory, 2020 Given a hypergraph and a function f : V () → , we say that is f-choosable if there is a proper vertex colouring ϕ of such that ϕ (v) ∈ L(v) for all v ∈ V (), where L : V () → 2 is any assignment of f(v) colours to a vertex v.
Drgas-Burchardt Ewa +1 more
doaj +1 more source
On Nordhaus-Gaddum type relations of δ-complement graphs. [PDF]
Heliyon, 2023 Vichitkunakorn P +2 more
europepmc +1 more source
An introduction to the k-defect polynomials
, 2019 The 0-defect polynomial of a graph is just the chromatic polynomial. This polynomial has been widely studied in the literature. Yet little is known about the properties of k-defect polynomials of graphs in general, when 0 < k ≤ |E(G)|.
Mphako-Banda, Eunice
core
Maximum Edge-Colorings Of Graphs
Discussiones Mathematicae Graph Theory, 2016 An r-maximum k-edge-coloring of G is a k-edge-coloring of G having a property that for every vertex v of degree dG(v) = d, d ≥ r, the maximum color, that is present at vertex v, occurs at v exactly r times. The r-maximum index χr′(G)$\chi _r^\prime (G)$
Jendrol’ Stanislav +1 more
doaj +1 more source