Results 41 to 50 of about 746 (100)
Proof of a local antimagic conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 An antimagic labelling of a graph $G$ is a bijection $f:E(G)\to\{1,\ldots,E(G)\}$ such that the sums $S_v=\sum_{e\ni v}f(e)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1994) is that every connected graph other than $K_2 ...
John Haslegrave
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2023 We introduce a concept in graph coloring motivated by the popular Sudoku puzzle. Let [Formula: see text] be a graph of order n with chromatic number [Formula: see text] and let [Formula: see text] Let [Formula: see text] be a k-coloring of the induced ...
J. Maria Jeyaseeli +3 more
doaj +1 more source
Subtract Divisor Cordial Labeling
International Journal of Innovative Technology and Exploring Engineering, 2019 A subtract divisor cordial labeling is bijection r: Z (G+ ) → {1,2,…,|V(G+ )|} in such a way that an edge uv give the label 1 if r(u) - r(v) is divisible by 2 otherwise give the label 0, then absolute difference of number of edges having label 1 and 0 is
J. Gondalia, A. Rokad
semanticscholar +1 more source
Skolem Mean like Labeling for Three Star Graph
Journal of Physics: Conference Series, 2019 In this paper, the connected three star graph G=K1,ϕ1∧K1,ϕ2∧K1,ϕ3 is a skolem mean like graph if and only if |ϕ2−ϕ3|≤ϕ1+4 and ϕ1+ϕ2+4≤ϕ3≤ϕ1+ϕ2−2, where ϕ1=1,2,3…,ϕ2=1,2,3,….
V. S. Shainy, V. Balaji
semanticscholar +1 more source
The 1-2-3 Conjecture for Hypergraphs [PDF]
, 2016 A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees.
Kalkowski, Maciej +2 more
core +2 more sources
SOME NEW SUM PERFECT SQUARE GRAPHS
, 2017 A (p, q) graph G = (V,E) is called sum perfect square if for a bijection f : V (G) → {0, 1, 2, . . . , p − 1} there exists an injection f∗ : E(G) → N defined by f∗(uv) = (f(u)) + (f(v)) + 2f(u) · f(v), ∀uv ∈ E(G).
S. G. Sonchhatra, G. V. Ghodasara
semanticscholar +1 more source
Improved bounds on the Radio degree of a cycle
IOP Conference Series: Materials Science and Engineering, 2019 A labeling f : V (G) → Z + such that |f(u)−f(v)| ≥ diam(G)+1−d(u, v) holds for every pair of vertices, u, v ∈ V (G), is called a radio labeling of a graph, G.
Radha Ramani Vanam +2 more
semanticscholar +1 more source
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.This article explores numerous significant additive topological indices based on degrees for linear functional graphs over finite‐dimensional vector spaces. Specifically, we derive some unique topological indices, such as the eccentricity‐based indices and the Wiener index.
Vinnarasi L. +4 more
wiley +1 more source
On the Sparing Number of the Edge-Corona of Graphs
, 2015 Let $\mathbb{N}_0$ be the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its the power set. An integer additive set-indexer (IASI) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the induced ...
Chithra, K. P. +2 more
core +2 more sources
Sharp bounds for partition dimension of generalized Möbius ladders
Open Mathematics, 2018 The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar +4 more
doaj +1 more source