Centers in iterated line graphs.
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On star polynomials, graphical partitions and reconstruction.”
Centers in iterated line graphs.
On coefficients of circuit polynomials and characteristic polynomials.
Farrell, E.J. (1985)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Centers in line graphs
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
On a class of polynomials associated with the cliques in a graph and its applications.
Farrell, E.J. (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Two-radially maximal graphs with special centers
Ferdinand Gliviak, Martin Knor, Ľubomír Šoltés (1995)
Mathematica Slovaca
Similarity:
On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs.
Farrell, E.J. (1983)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On coefficients of path polynomials.
Farrell, E.J. (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A broadcasting algorithm with time and message optimum on arrangement graphs.
Bai, Leqiang, Maeda, Hajime, Ebara, Hiroyuki, Nakano, Hideo (1998)
Journal of Graph Algorithms and Applications
Similarity: