A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

As libraries become increasingly based on digital storage and access technologies, knowledge management approaches seem particularly useful. Most knowledge management systems emphasize the role of information and communications technologies, and the question arises about the role of librarians in these systems. This paper posits that if globally digital libraries are to realize their potential ...

Web 2.0 technologies, such as shared documents, Wikis, and virtual social networks, are increasingly used for communication in complex IT projects. In this study, we apply the boundary spanning theoretical perspective and Carlile’s (2002) model of boundary complexity to investigate how these tools relate to projects’ outcomes, and analyze the characteristics of the projects and organizations wh...

Purpose This study aims to how first-tier suppliers (FTs) operate as boundary-spanners between the focal firm and second-tier (STs) in extending sustainability-oriented supplier development (SSD) initiatives up supply chain. Design/methodology/approach An exploratory multi-case approach apparel industry is adopted, comprised of four cases focused on occupational health safety issues. The paper ...