On coefficients of path polynomials.
Farrell, E.J. (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture.”
On coefficients of path polynomials.
Centers in iterated line graphs.
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
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:
Centers in line graphs
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
Methods of destroying the symmetries of a graph.
Harary, Frank (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
On some path problems on oriented hypergraphs
S. Nguyen, D. Pretolani, L. Markenzon (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Control flow graphs and code coverage
Robert Gold (2010)
International Journal of Applied Mathematics and Computer Science
Similarity:
The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage...