Results 41 to 50 of about 547 (79)
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
Lobsters with an almost perfect matching are graceful [PDF]
, 2014 Let $T$ be a lobster with a matching that covers all but one vertex.
Krop, Elliot
core
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
Computing metric dimension of compressed zero divisor graphs associated to rings
Acta Universitatis Sapientiae: Mathematica, 2018 For a commutative ring R with 1 ≠ 0, a compressed zero-divisor graph of a ring R is the undirected graph ΓE(R) with vertex set Z(RE) \ {[0]} = RE \ {[0], [1]} defined by RE = {[x] : x ∈ R}, where [x] = {y ∈ R : ann(x) = ann(y)} and the two distinct ...
Pirzada S., Bhat M. Imran
doaj +1 more source
Invariant monotone coupling need not exist
, 2013 We show by example that there is a Cayley graph, having two invariant random subgraphs X and Y, such that there exists a monotone coupling between them in the sense that $X\subset Y$, although no such coupling can be invariant.
Mester, Péter
core +1 more source
Further results on Parity Combination Cordial Labeling
Journal of the Egyptian Mathematical Society, 2020 Let G be a (p, q)-graph. Let f be an injective mapping from V(G) to {1, 2, …, p}. For each edge xy, assign the label x y $$ \left(\genfrac{}{}{0pt}{}{x}{y}\right) $$ or y x $$ \left(\genfrac{}{}{0pt}{}{y}{x}\right) $$ according as x > y or y > x.
Mohamed Seoud, Mohamed Aboshady
doaj +1 more source
Weak Set-Labeling Number of Certain IASL-Graphs
, 2015 Let $\mathbb{N}_0$ be the set of all non-negative integers, let $X\subset \mathbb{N}_0$ and $\mathcal{P}(X)$ be the the power set of $X$. An integer additive set-labeling (IASL) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$
Chithra, K. P. +2 more
core +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
Super (a, d)-H-antimagic labeling of subdivided graphs
Open Mathematics, 2018 A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G isomorphic to H. A graph G admitting an H-covering is called an (a, d)-H-antimagic if there exists a bijective function f : V(G) ∪ E(G) → {1, 2, …, |V(G)| + |
Taimur Amir +4 more
doaj +1 more source
Topological Integer Additive Set-Sequential Graphs
, 2015 Let $\mathbb{N}_0$ denote the set of all non-negative integers and $X$ be any non-empty subset of $\mathbb{N}_0$. Denote the power set of $X$ by $\mathcal{P}(X)$. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $
Augustine, Germina +2 more
core +2 more sources