Displaying similar documents to “Supermagic Graphs Having a Saturated Vertex”

On magic joins of graphs

Jaroslav Ivančo, Tatiana Polláková (2012)

Mathematica Bohemica

Similarity:

A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.

The niche graphs of interval orders

Jeongmi Park, Yoshio Sano (2014)

Discussiones Mathematicae Graph Theory

Similarity:

The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N+D(x) ∩ N+D(y) ≠ ∅ or N−D(x) ∩ N−D(y) ≠ ∅, where N+D(x) (resp. N−D(x)) is the set of out-neighbors (resp. in-neighbors) of x in D. A digraph D = (V,A) is called a semiorder (or a unit interval order ) if there exist a real-valued function f : V → R on the set V and a positive real number δ ∈ R such that (x, y) ∈ A if...