Abstract
Let G be a graph of order n,P(G;x)=det(xI_n-L(G))=∑_(k=0)~n(-1)~kc_k(G)x~(n-k)be the characteristic polynominal of its Laplacian matrix.In this paper,we determine the graph with the smallest k-th Laplacian coefficient among all connected bipartite bicyclic graphs of order n.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
