On graphs with nonisomorphic -neighbourhoods
Halina Bielak (1983)
Časopis pro pěstování matematiky
Similarity:
Halina Bielak (1983)
Časopis pro pěstování matematiky
Similarity:
Pavol Híc (1989)
Mathematica Slovaca
Similarity:
Boram Park, Yoshio Sano (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced subgraph, respectively. Phylogeny graphs are variant of competition graphs. The phylogeny graph P(D) of a digraph D is the (simple undirected) graph defined by V (P(D)) := V (D) and E(P(D)) := {xy | N+D (x) ∩ N+D(y) ¹ ⊘ } ⋃ {xy | (x,y)...
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different 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 establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Salar Y. Alsardary (1994)
Czechoslovak Mathematical Journal
Similarity:
Juraj Bosák (1979)
Mathematica Slovaca
Similarity:
Daniel C. Slilaty, Thomas Zaslavsky (2015)
Discussiones Mathematicae Graph Theory
Similarity:
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e., edge-signed graphs whose line graphs, with the naturally induced vertex signature, are consistent. Their proof applies Hoede’s relatively difficult characterization of consistent vertex-signed graphs. We give a simple proof that does...