Penta-Extensions of Hereditary Classes of Graphs

Penta is the configuration shown in figure 1(a), where continuous lines represent edges and dotted lines represent non-edges. The vertex u in figure 1(a) is called the center of Penta. A graph G is called a pentagraph if every induced subgraph H of G has a vertex v which is not a center of induced Penta in H. The class of pentagraphs is a common generalization of chordal [triangulated] graphs and Mahadev graphs. We construct a polynomial-time algorithm that either find a maximum stable set of G or concludes that G is not a pentagraph. We propose a method for extending α-polynomial hereditary classes based on induced Pentas.     

Analysis of Exogenous Components of Mortality Risks

A new technique for deriving exogenous components of mortality risks from national vital statistics has been developed. Each observed death rate D_ij (where i corresponds to calendar time (year or interval of years) and j denotes the number of corresponding age group) was represented as D_ij=A_j+B_iC_j, and unknown quantities A_j, B_i, and C_j were estimated by a special procedure using the least-squares principle. The coefficients of variation do not exceed 10%. It is shown that the term A_j can be interpreted as the endogenous and the second term B_iC_j as the exogenous components of the death rate. The aggregate of endogenous components A_j can be described by a regression function, corresponding to the Gompertz-Makeham law, A(τ) =γ+β· eατ, where γ, β, and α are constants, τ is age, AττAττA_j, and τ_j, is the value of age τ in jth age group. The coefficients of variation for such a representation does not exceed 4%. An analysis of exogenous risk levels in the Moscow and Russian populations during 1980–1995 shows that since 1992 all components of exogenous risk in the Moscow population had been increasing up to 1994. The greatest contribution to the total level of exogenous risk was lethal diseases, and their death rate was 387 deaths per 100,000 persons in 1994, i.e., 61.9% of all deaths. The dynamics of exogenous mortality risk change during 1990–1994 in the Moscow population and in the Russian population without Moscow had been identical: the risk had been increasing, and its value in the Russian population had been higher than that in the Moscow population.     

Sharp bounds of the Zagreb indices of k-trees

For a graph G, the first Zagreb index M ₁ is equal to the sum of squares of the vertex degrees, and the second Zagreb index M ₂ is equal to the sum of the products of degrees of pairs of adjacent vertices. The Zagreb indices have been the focus of considerable research in computational chemistry dating back to Gutman and Trinajsti? in 1972. In 2004, Das and Gutman determined sharp upper and lower bounds for M ₁ and M ₂ values for trees along with the unique trees that obtain the minimum and maximum M ₁ and M ₂ values respectively. In this paper, we generalize the results of Das and Gutman to the generalized tree, the k-tree, where the results of Das and Gutman are for k=1. Also by showing that maximal outerplanar graphs are 2-trees, we also extend a result of Hou, Li, Song, and Wei who determined sharp upper and lower bounds for M ₁ and M ₂ values for maximal outerplanar graphs.     

The Pfaffian property of Cartesian products of graphs

Suppose that G=(V,E) is a graph with even vertices. An even cycle C is a nice cycle of G if G?V(C) has a perfect matching. An orientation of G is a Pfaffian orientation if each nice cycle C has an odd number of edges directed in either direction of the cycle. Let P _n and C _n denote the path and the cycle on n vertices, respectively. In this paper, we characterize the Pfaffian property of Cartesian products G×P _2n and G×C _2n for any graph G in terms of forbidden subgraphs of G. This extends the results in (Yan and Zhang in Discrete Appl Math 154:145–157, 2006).     

Edge-colouring of joins of regular graphs II

We prove that the edges of every even graph G=G ₁+G ₂ that is the join of two regular graphs G ₁ and G ₂ can be coloured with Δ(G) colours, whenever Δ(G)=Δ(G ₁)+|V ₂|. The proof of this result together with the results in De Simone and Galluccio (J. Comb. Optim. 18:417–428, 2009) states that every even graph G that is the join of two regular graphs is Class 1. The proof yields an efficient combinatorial algorithm to find a Δ(G)-edge-colouring of this type of graphs.     

Governance of open source software: state of the art

In this overview of governance mechanisms developed within open source software (OSS) circles, three types of governance are studied: ‘spontaneous’ governance, internal governance, and governance towards outside parties. Moreover, two main ways in which lessons from OSS can be applied elsewhere are explored: peer production of products other than software, and embedding ‘peer-produced’ products and peer processes into existing institutions (‘coupling’).

Minimal Tetrahedralizations of a Class of Polyhedra

Given a simple polyhedron P in the three dimensional Euclidean space, different tetrahedralizations of P may contain different numbers of tetrahedra. The minimal tetrahedralization is a tetrahedralization with the minimum number of tetrahedra. In this paper, we present some properties of the graph of polyhedra. Then we identify a class of polyhedra and show that this kind of polyhedra can be minimally tetrahedralized in O(n ²) time.     

Opportunities of Reforming the WTO: Resistance and Potentials of Change

This paper intends to show both that a reform of the WTO is severely needed in order to establish a fairer international trade order but also that it is possible. The first section of this paper analyzes the functioning and the most controversial rules of the organization. The second and third sections intend to look for current opportunities of reforming the WTO by analyzing the main existing critical responses to the institution’s deficiencies—namely coalitions of southern Nation-States and global civil society movements—and their potential to achieve some change. It is concluded that these two key group actors, while playing different roles, do have common goals on selected issues of international trade and if so, their combined negotiating power is considerably increased for achieving a progress in the direction of a positive reform of the WTO for the developing world.

Equivalence of two conjectures on equitable coloring of graphs

A graph G is said to be equitably k-colorable if there exists a proper k-coloring of G such that the sizes of any two color classes differ by at most one. Let Δ(G) denote the maximum degree of a vertex in G. Two Brooks-type conjectures on equitable Δ(G)-colorability have been proposed in Chen and Yen (Discrete Math., 2011) and Kierstead and Kostochka (Combinatorica 30:201–216, 2010) independently. We prove the equivalence of these conjectures.     

Further Evaluation of the Accuracy of Managerial Prediction of Employee Preference

Previous research (i.e., Wilder, Rost, &; McMahon, 2007 Wilder, D. A., Rost, K. and McMahon, M. 2007. The accuracy of managerial prediction of employee preference: A brief report. Journal of Organizational Behavior Management, 27(2): 1–14. [Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) has suggested that managers perform poorly when predicting items and activities which their employees state that they might like to earn as part of performance improvement programs. The purpose of the current study was to replicate the earlier study conducted by Wilder et al. (2007 Wilder, D. A., Rost, K. and McMahon, M. 2007. The accuracy of managerial prediction of employee preference: A brief report. Journal of Organizational Behavior Management, 27(2): 1–14. [Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) with a larger and more diverse sample of managers and employees. One hundred employees and 15 managers were asked to rank order a list of items/activities they thought their employees would most prefer to be incorporated into a performance improvement plan. Next, employee preference for these same items was directly assessed using an employee reinforcer survey. Kendall rank-order correlation coefficients were used to compare the results of the managerial rank with the employee reinforcer survey. Correlations ranged from ?.6 to 1, with a mean of .25.     

Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem

In the binary single constraint Knapsack Problem, denoted KP, we are given a knapsack of fixed capacity c and a set of n items. Each item j, j = 1,...,n, has an associated size or weight w_j and a profit p_j. The goal is to determine whether or not item j, j = 1,...,n, should be included in the knapsack. The objective is to maximize the total profit without exceeding the capacity c of the knapsack. In this paper, we study the sensitivity of the optimum of the KP to perturbations of either the profit or the weight of an item. We give approximate and exact interval limits for both cases (profit and weight) and propose several polynomial time algorithms able to reach these interval limits. The performance of the proposed algorithms are evaluated on a large number of problem instances.     

The domination number of Cartesian product of two directed paths

Let γ(P _m □P _n ) be the domination number of the Cartesian product of directed paths P _m and P _n for m,n≥2. Liu et al. in (J. Comb. Optim. 22(4):651–662, 2011) determined the value of γ(P _m □P _n ) for arbitrary n and m≤6. In this work we give the exact value of γ(P _m □P _n ) for any m,n and exhibit dominating sets of minimum cardinality.     

On the union of intermediate nodes of shortest paths

Consider a connected graph G=(V,E). For a pair of nodes u and v, denote by M _uv the set of intermediate nodes of a shortest path between u and v. We are intertested in minimization of the union ? _u,v∈V M _uv . We will show that this problem is NP-hard and cannot have polynomial-time ρlnδ-approximation for 0<ρ<1 unless NP?DTIME(n ^O(loglogn)) where δ is the maximum node degree of input graph. We will also construct a polynomial-time $H(\frac{\delta (\delta -1)}{2})$ -approximation for the problem where H(?) is the harmonic function.     

L(2,1)-labelings of the edge-path-replacement of a graph

For two positive integers j and k with j≥k, an L(j,k)-labeling of a graph G is an assignment of nonnegative integers to V(G) such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L(j,k)-labeling of a graph G is the difference between the maximum and minimum integers used by it. The L(j,k)-labelings-number of G is the minimum span over all L(j,k)-labelings of G. This paper focuses on L(2,1)-labelings-number of the edge-path-replacement G(P _k ) of a graph G. Note that G(P ₃) is the incidence graph of G. L(2,1)-labelings of the edge-path-replacement G(P ₃) of a graph, called (2,1)-total labeling of G, was introduced by Havet and Yu in 2002 (Workshop graphs and algorithms, Dijon, France, 2003; Discrete Math. 308:498–513, 2008). They (Havet and Yu, Discrete Math. 308:498–513, 2008) obtain the bound $\Delta+1\leq\lambda^{T}_{2}(G)\leq2\Delta+1$ and conjectured $\lambda^{T}_{2}(G)\leq\Delta+3$ . In this paper, we obtain that λ(G(P _k ))≤Δ+2 for k≥5, and conjecture λ(G(P ₄))≤Δ+2 for any graph G with maximum degree Δ.     

Central State Steering of Local Collaboration: Assessing the Impact of Tools of Meta-governance in Homelessness Services in England

Much of the discussion of state steering of service delivery networks to encourage collaboration at the local level has been theoretical. This study builds on this analysis systematically to assess the relationship between meta-governance tools of central government steering and the extent of local collaboration, using the case of homelessness services in England. Contrary to the pessimist expectations of some contemporary theory, central government funding tools and facilitating the transfer of best practice encourages collaboration. However, simple information provision and authority based tools are only partially effective, risking tokenistic compliance. Authority tools are more effective when combined with other tools.

Hamiltonicity of hypercubes with a constraint of required and faulty edges

Let R and F be two disjoint edge sets in an n-dimensional hypercube Q _n . We give two constructing methods to build a Hamiltonian cycle or path that includes all the edges of R but excludes all of F. Besides, considering every vertex of Q _n incident to at most n−2 edges of F, we show that a Hamiltonian cycle exists if (A) |R|+2|F|≤2n−3 when |R|≥2, or (B) |R|+2|F|≤4n−9 when |R|≤1. Both bounds are tight. The analogous property for Hamiltonian paths is also given. Dedicated to Professor Frank K. Hwang on the occasion of his 65th birthday. Lih-Hsing Hsu’s research project is partially supported by NSC 95-2221-E-233-002. Shu-Chung Liu’s research project is partially supported by NSC 90-2115-M-163-003 and 95-2115-M-163-002. Yeong-Nan Yeh’s research project is partially supported by NSC 95-2115-M-001-009.     

L(d,1)-labelings of the edge-path-replacement of a graph

For two positive integers j and k with j≥k, an L(j,k)-labeling of a graph G is an assignment of nonnegative integers to V(G) such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L(j,k)-labeling of a graph G is the difference between the maximum and minimum integers used by it. The L(j,k)-labelings-number of G is the minimum span over all L(j,k)-labelings of G. This paper focuses on L(d,1)-labelings-number of the edge-path-replacement G(P _k ) of a graph G. Note that G(P ₃) is the incidence graph of G. L(d,1)-labelings of the edge-path-replacement G(P _k ) of a graph, called (d,1)-total labeling of G, was introduced in 2002 by Havet and Yu (Workshop graphs and algorithms, 2003; Discrete Math 308:493–513, 2008). Havet and Yu (Discrete Math 308:498–513, 2008) obtained the bound $\Delta+ d-1\leq\lambda^{T}_{d}(G)\leq2\Delta+ d-1$ and conjectured $\lambda^{T}_{d}(G)\leq\Delta+2d-1$ . In (Lü in J Comb Optim, to appear; Zhejiang University, submitted), we worked on L(2,1)-labelings-number and L(1,1)-labelings-number of the edge-path-replacement G(P _k ) of a graph G, and obtained that λ(G(P _k ))≤Δ+2 for k≥5, and conjecture λ(G(P ₄))≤Δ+2 for any graph G with maximum degree Δ. In this paper, we will study L(d,1)-labelings-number of the edge-path-replacement G(P _k ) of a graph G for d≥3 and k≥4.     

An Objective Review of the Journal of Organizational Behavior Management

Abstract

This article presents an objective review and analysis of every article published in the Journal of Organizational Behavior Management (JOBM) between 1987 and 1997. The purpose of this review was to replicate and extend the research conducted by Balcazar, Shup-ert, Daniels, Mawhinney, and Hopkins (1989) by providing an objective review and analysis of the second decade of JOBM publications. In doing so, we analyzed several noteworthy trends and patterns occurring within the second decade of the Journal and compared them with the first decade, where applicable. Additionally, we discussed the extent to which the Journal has continued to meet its objectives, and we offered recommendations for future JOBM publications. In general, we found evidence that the Journal has continued to grow in meaningful ways, and we report data that indicate it continues, to some extent, to meet its original objectives. Author affiliation remains largely in academe, although there is evidence that more collaboration is occurring with non-academic authors. The variety of topics addressed by JOBM researchers continues to grow, and the frequency of work simulation studies has increased as well. We also identified areas where future JOBM research could be improved. In particular, more studies should include information on the reliability and social validity of the independent and dependent variables, cost/benefit analyses, and follow-up data.