Results 71 to 80 of about 920 (119)

$H$-product and $H$-threshold graphs

, 2011
This paper is the continuation of the research of the author and his colleagues of the {\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent the graph ...
Bang-Jensen, Barrus, Barrus, Borri, Chernyak, Chvatal, Courcelle, Gurski, Hammer, Kleitman, Limouzy, Maffray, Mahadev, Maksimovich, Marchioro, Pavel Skums, Peled, Skums, Skums, Skums, Skums, Tyshkevich, Tyshkevich, Tyshkevich, Tyshkevich, Wanke, Yannakakis   +26 more
core   +1 more source

Distance Magic Graphs - a Survey [PDF]

, 2011
Let <i>G = (V;E)</i> be a graph of order n. A bijection <i>f : V &rarr; {1, 2,...,n} </i>is called <i>a distance magic labeling </i>of G if there exists a positive integer k such that <i>&Sigma; f(u) = k &
Arumugam, S. (S), Froncek, D. (Dalibor), Kamatchi, N. (N)   +2 more
core  

Minimum-Weight Edge Discriminator in Hypergraphs [PDF]

, 2012
In this paper we introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph $\mathcal H=(\mathcal V, \mathcal E)$, a function $\lambda: \mathcal V\rightarrow \mathbb Z^{+}\cup\{0\}$ is ...
Bhattacharya, Bhaswar B., Das, Sayantan, Ganguly, Shirshendu   +2 more
core  

Super -edge antimagic total labeling of a subclass of trees

AKCE International Journal of Graphs and Combinatorics, 2017
A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges.
M. Javaid, A.A. Bhatti, M.K. Aslam
doaj   +1 more source

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

JTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik, Iftitahul Firdausiyah, Robiatul Adawiyah, Ika Hesti Agustin, Indah Lutfiyatul Mursyidah, Marsidi Marsidi   +5 more
doaj   +1 more source

Antimagic and product antimagic graphs with pendant edges

20 pages, 6 ...
Mora, Mercè, Tey, Joaquín
openaire   +2 more sources

Antimagic Labeling for Some Snake Graphs

Proyecciones (Antofagasta)
A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. In this paper we study antimagic labeling of double triangular snake, alternate triangular snake, double alternate triangular snake, quadrilateral snake, double ...
Chirag Barasara, Palak Prajapati
openaire   +1 more source

Super Total Labeling (a,d)- edge Antimagic on the Firecracker Graph

Cauchy: Jurnal Matematika Murni dan Aplikasi, 2020
An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V (G) ∪ E(G) onto the  integers 1, 2, . . . , p + q with the property that the edge-weights, w(uv) = f (u)+ f (v) + f (uv) where uv ∈  E(G),form an arithmetic ...
Juhari Juhari
doaj   +1 more source

The analysis of the implementation of RBL-STEM learning materials in improving student's meta-literacy ability to solve wallpaper decoration problems using local antimagic graph coloring techniques. [PDF]

Heliyon, 2023
Dafik, Kadir, Maryati TK, Sufirman, Ridlo ZR.   +4 more
europepmc   +1 more source

On Distance Magic Harary Graphs

, 2018
This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for
Paramasivam, Krishnan, Prajeesh, A V
core