We add a fixed number of vertices of degree 1 to each vertex from one part of a bipartite graph. We study characteristic, matching and some related polynomials for graphs obtained in this way.
Bulletin (Académie serbe des sciences et des arts. Classe des sciences mathématiques et naturelles. Sciences mathématiques), No. 23 (1998), pp. 91-100 (10 pages) We consider the problem of ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback