Natural bijections between directed and undirected self-complementary graphs
Page 1
Bohdan Zelinka (1987)
Mathematica Slovaca
Bohdan Zelinka (1983)
Czechoslovak Mathematical Journal
Ľubomír Šoltés (1992)
Mathematica Slovaca
Ali A. Ali, Salar Y. Alsardary (1997)
Czechoslovak Mathematical Journal
Let be an undirected simple connected graph, and be an edge of . Let be the subgraph of induced by the set of all vertices of which are not incident to but are adjacent to or . Let be the class of all graphs such that, for some graph , for every edge of . Zelinka [3] studied edge neighborhood graphs and obtained some special graphs in . Balasubramanian and Alsardary [1] obtained some other graphs in . In this paper we given some new graphs in .
Ladislav Nebeský (2002)
Czechoslovak Mathematical Journal
In [3], the present author used a binary operation as a tool for characterizing geodetic graphs. In this paper a new proof of the main result of the paper cited above is presented. The new proof is shorter and simpler.
Fuyuan Chen (2015)
Czechoslovak Mathematical Journal
A maximum matching of a graph is a matching of with the largest number of edges. The matching number of a graph , denoted by , is the number of edges in a maximum matching of . In 1966, Gallai conjectured that all the longest paths of a connected graph have a common vertex. Although this conjecture has been disproved, finding some nice classes of graphs that support this conjecture is still very meaningful and interesting. In this short note, we prove that Gallai’s conjecture is true for...
Miller, Mirka (2011)
The Electronic Journal of Combinatorics [electronic only]
Li, Xueliang, Liu, Yan (2008)
The Electronic Journal of Combinatorics [electronic only]
Gabriel Tucci (2013)
Open Mathematics
In this paper we prove that random d-regular graphs with d ≥ 3 have traffic congestion of the order O(n logd−13 n) where n is the number of nodes and geodesic routing is used. We also show that these graphs are not asymptotically δ-hyperbolic for any non-negative δ almost surely as n → ∞.
Heinz-Jürgen Voss (1985)
Commentationes Mathematicae Universitatis Carolinae
Jaroslav Ivančo (1994)
Mathematica Bohemica
Let the number of -element sets of independent vertices and edges of a graph be denoted by and , respectively. It is shown that the graphs whose every component is a circuit are the only graphs for which the equality is satisfied for all values of .
Xu, Rui, Zhang, Cun-Quan (2003)
The Electronic Journal of Combinatorics [electronic only]
Jan Kratochvíl, Jiří Matoušek (1989)
Commentationes Mathematicae Universitatis Carolinae
Page 1