Showing papers in "Discrete Applied Mathematics in 2015"

TL;DR: This paper presents a geometrical approach to the Fisher distance, which is a measure of dissimilarity between two probability distribution functions, and takes advantage of the connection with the classical hyperbolic geometry to derive closed forms for the Fisherdistance in several cases.

TL;DR: In this article, the generalized multiplicative Zagreb index was extended to the generalized tree, the k -tree, where the results of Gutman are for k = 1. And the extremal graphs were characterized and the exact bounds of these indices of k -trees were obtained.

TL;DR: The results resolve a problem posed by Meyer about regular bipartite circulant graphs and present a relationship between the k -forcing number and the connected k -domination number.

TL;DR: This work investigates the combinatorial structure of double squares and shows that a string of length n contains at most ?

TL;DR: Some distance measures for comparing Interval Type-2 fuzzy numbers based on their centroids are shown and some interpretation issues are explained.

TL;DR: In this paper, the Inverse Sum Indeg index was selected as a significant predictor of total surface area of octane isomers, and extremal values of this index across several graph classes, including connected graphs, chemical graphs, trees and chemical trees.

TL;DR: It is shown that an n -dimensional Bubble-sort star graph is (2 n - 5) -fault-tolerant maximally local-connected and is also ( 2 n - 6) -Fault-Tolerant one-to-many maximallyLocal-connected.

TL;DR: This work discusses three types of discretization orders, the complexity of determining their existence in a given graph, and the inclusion relations between the three order existence problems.

TL;DR: A local majority algorithm, with two opinions, where nodes poll a subset of their neighbours and update their opinion to the opinion of the majority of the polled neighbours is studied.

TL;DR: This article proposes a new mixed integer linear program to represent the QoS-aware web service composition problem with a polynomial number of variables and constraints and presents some experimental results showing that the proposed model is able to solve big size instances.

TL;DR: This work considers the well-known one dimensional cutting stock problem (1CSP) using the proper LP relaxation of the Gilmore and Gomory model, and computationally shows that all 1CSP instances with n ?

TL;DR: The resistance distances and the Kirchhoff index of G 1 { v } G 2 and G 1{ e} G 2 respectively are formulated.

TL;DR: It is shown that the m -by- n grid has no 3-dynamic 4-coloring when m n ? 2 mod 4 (for m , n ? 3 ), which completes the determination of the r -dynamic chromatic number of the m-by-N grid for all r, m, n.

TL;DR: This work presents tight approximation results for the max min vertex cover problem, namely a polynomial approximation algorithm which guarantees an?

TL;DR: It is proved that the diameter of the set of graphs, as a pseudo-metric space equipped with d 1, is one and the behavior of d 1 when the size of graphs tends to infinity is studied by interlacing inequalities aiming at exploring large real networks.

TL;DR: In this article, the authors study three resistance distance-based graph invariants: the Kirchhoff index, and two modifications, namely, the multiplicative degree-Kirchhoff indices and the additive degree-kirchhoffs index.

TL;DR: An infinite set of k -critical P 5 -free graphs for every k -chromatic graph G ?

TL;DR: It is proved that the space of all realizations of a given joint degree matrix over a fixed vertex set is connected via these restricted swap operations, which was claimed before but there is a flaw in the proof.

TL;DR: A better upper bound is obtained for the packing chromatic number of hypercubes Q n and the lower bounds for ?

TL;DR: An O ( n 3 ) algorithm to find a minimum weighted coloring of a ( P 5 , P � 5 )-free graph is designed and can be used to solve the same problem for several classes of graphs, defined by forbidden induced subgraphs, such as (diamond, co-diamond)-free graphs.

TL;DR: The computational complexity of the Densestk-Subgraph problem, where the input is an undirected graph G=(V,E) and one wants to find a subgraph on exactly k vertices with the maximum number of edges is investigated.

TL;DR: In this article, the authors presented several simple constructions for 1-intersecting codes of k-dimensional subspaces over F q n, n? (k + 1 2 ), where the code size is q k + 1 - 1 q - 1, and rank distance n - 1.

TL;DR: It is proved that r ?

TL;DR: In this paper, it was shown that every d -regular graph G has χ c (G ) ≥ ( 1 − o ( 1 ) ) d / log d as d → ∞, and the proportion of d-regular graphs G for which χc ( G ) ≤ ( 1 + o (1 ) )d/ log d tends to 1.

TL;DR: The star-critical Ramsey number r ?

TL;DR: It is shown that if G is a planar graph with Δ ( G ) ?

TL;DR: In this article, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. was generalized in a recursive manner, where compositional inverses of known ones were derived.

TL;DR: It is shown that very simple algorithms based on local search are polynomial-time approximation schemes for Maximum Independent Set, Minimum Vertex Cover and Minimum Dominating Set, when the input graphs have a fixed forbidden minor.

TL;DR: It is proved that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are 2 m lines of eachcolor, there is a segment intercepting m lines in the plane.

TL;DR: In this article, the optimization of chip shooter component placement machines is studied and the authors decompose the problem into placement sequencing problem and feeder configuration problem which turn out to be sequence dependent traveling salesman problem (SDTSP) and Quadratic Assignment Problem (QAP), respectively.