On graphs with prescribed subgraphs of order , and a theorem of Kelly and Merriell
Page 1
Displaying 1 – 12 of 12
On hereditary properties of composition graphs
Vadim E. Levit, Eugen Mandrescu (1998)
Discussiones Mathematicae Graph Theory
The composition graph of a family of n+1 disjoint graphs is the graph H obtained by substituting the n vertices of H₀ respectively by the graphs H₁,H₂,...,Hₙ. If H has some hereditary property P, then necessarily all its factors enjoy the same property. For some sort of graphs it is sufficient that all factors have a certain common P to endow H with this P. For instance, it is known that the composition graph of a family of perfect graphs is also a perfect graph (B. Bollobas, 1978), and the...
On highly closed cellular algebras and highly closed isomorphisms.
Evdokimov, Sergei, Ponomarenko, Ilia (1999)
The Electronic Journal of Combinatorics [electronic only]
On homomorphism perfect graphs
Pavel Křivka (1971)
Commentationes Mathematicae Universitatis Carolinae
On -pairable graphs from trees
Zhongyuan Che (2007)
Czechoslovak Mathematical Journal
The concept of the -pairable graphs was introduced by Zhibo Chen (On -pairable graphs, Discrete Mathematics 287 (2004), 11–15) as an extension of hypercubes and graphs with an antipodal isomorphism. In the same paper, Chen also introduced a new graph parameter , called the pair length of a graph , as the maximum such that is -pairable and if is not -pairable for any positive integer . In this paper, we answer the two open questions raised by Chen in the case that the graphs involved...
On Principal Graphs and Weak Duality.
V.S. Sunder, Uma Krishnan (1994)
Mathematica Scandinavica
On self-complementary cyclic packing of forests.
Wojda, A.Pawel, Wozniak, Mariusz, Ziolo, Irmina A. (2007)
The Electronic Journal of Combinatorics [electronic only]
On some non-obvious connections between graphs and unary partial algebras
Konrad Pióro (2000)
Czechoslovak Mathematical Journal
In the present paper we generalize a few algebraic concepts to graphs. Applying this graph language we solve some problems on subalgebra lattices of unary partial algebras. In this paper three such problems are solved, other will be solved in papers [Pió I], [Pió II], [Pió III], [Pió IV]. More precisely, in the present paper first another proof of the following algebraic result from [Bar1] is given: for two unary partial algebras and , their weak subalgebra lattices are isomorphic if and only...
On star polynomials, graphical partitions and reconstruction.
Farrell, E.J., de Matas, C.M. (1988)
International Journal of Mathematics and Mathematical Sciences
On the automorphism group of integral circulant graphs.
Bašić, Milan, Ilić, Aleksandar (2011)
The Electronic Journal of Combinatorics [electronic only]
On the reconstruction of the matching polynomial and the reconstruction conjecture.
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
On Ulam's hypothesis
Müller, V. (1976)
Abstracta. 4th Winter School on Abstract Analysis
Currently displaying 1 – 12 of 12
Page 1