for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> MATHEMATICS (Total: 879 journals)
    - APPLIED MATHEMATICS (71 journals)
    - GEOMETRY AND TOPOLOGY (19 journals)
    - MATHEMATICS (651 journals)
    - MATHEMATICS (GENERAL) (42 journals)
    - NUMERICAL ANALYSIS (19 journals)
    - PROBABILITIES AND MATH STATISTICS (77 journals)

MATHEMATICS (651 journals)                  1 2 3 4 | Last

Showing 1 - 200 of 538 Journals sorted alphabetically
Abakós     Open Access   (Followers: 3)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 2)
Academic Voices : A Multidisciplinary Journal     Open Access   (Followers: 2)
Accounting Perspectives     Full-text available via subscription   (Followers: 8)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 16)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 4)
ACM Transactions on Mathematical Software (TOMS)     Hybrid Journal   (Followers: 6)
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 21)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 1)
Acta Mathematica     Hybrid Journal   (Followers: 11)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 2)
Acta Mathematica Scientia     Full-text available via subscription   (Followers: 5)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 5)
Acta Mathematica Vietnamica     Hybrid Journal  
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal  
Advanced Science Letters     Full-text available via subscription   (Followers: 7)
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 3)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Complex Systems     Hybrid Journal   (Followers: 7)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 15)
Advances in Decision Sciences     Open Access   (Followers: 4)
Advances in Difference Equations     Open Access   (Followers: 1)
Advances in Fixed Point Theory     Open Access   (Followers: 5)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 10)
Advances in Linear Algebra & Matrix Theory     Open Access   (Followers: 1)
Advances in Materials Sciences     Open Access   (Followers: 16)
Advances in Mathematical Physics     Open Access   (Followers: 5)
Advances in Mathematics     Full-text available via subscription   (Followers: 10)
Advances in Numerical Analysis     Open Access   (Followers: 4)
Advances in Operations Research     Open Access   (Followers: 11)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Pure and Applied Mathematics     Hybrid Journal   (Followers: 5)
Advances in Pure Mathematics     Open Access   (Followers: 4)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2)
African Journal of Educational Studies in Mathematics and Sciences     Full-text available via subscription   (Followers: 5)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
Afrika Matematika     Hybrid Journal   (Followers: 1)
Air, Soil & Water Research     Open Access   (Followers: 7)
AKSIOMA Journal of Mathematics Education     Open Access   (Followers: 1)
Algebra and Logic     Hybrid Journal   (Followers: 3)
Algebra Colloquium     Hybrid Journal   (Followers: 4)
Algebra Universalis     Hybrid Journal   (Followers: 2)
Algorithmic Operations Research     Full-text available via subscription   (Followers: 5)
Algorithms     Open Access   (Followers: 10)
Algorithms Research     Open Access   (Followers: 1)
American Journal of Biostatistics     Open Access   (Followers: 9)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 3)
American Journal of Mathematical Analysis     Open Access  
American Journal of Mathematics     Full-text available via subscription   (Followers: 7)
American Journal of Operations Research     Open Access   (Followers: 5)
American Mathematical Monthly     Full-text available via subscription   (Followers: 6)
An International Journal of Optimization and Control: Theories & Applications     Open Access   (Followers: 7)
Analele Universitatii Ovidius Constanta - Seria Matematica     Open Access   (Followers: 1)
Analysis     Hybrid Journal   (Followers: 2)
Analysis and Applications     Hybrid Journal   (Followers: 1)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 3)
Analysis Mathematica     Full-text available via subscription  
Annales Mathematicae Silesianae     Open Access  
Annales mathématiques du Québec     Hybrid Journal   (Followers: 4)
Annales UMCS, Mathematica     Open Access   (Followers: 1)
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica     Open Access  
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 8)
Annals of Discrete Mathematics     Full-text available via subscription   (Followers: 6)
Annals of Mathematics     Full-text available via subscription  
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 6)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of the Alexandru Ioan Cuza University - Mathematics     Open Access  
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1)
Annals of West University of Timisoara - Mathematics     Open Access  
Annuaire du Collège de France     Open Access   (Followers: 5)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applications of Mathematics     Hybrid Journal   (Followers: 1)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 12)
Applied Mathematics     Open Access   (Followers: 3)
Applied Mathematics     Open Access   (Followers: 4)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 4)
Applied Mathematics - A Journal of Chinese Universities     Hybrid Journal  
Applied Mathematics Letters     Full-text available via subscription   (Followers: 1)
Applied Mathematics Research eXpress     Hybrid Journal   (Followers: 1)
Applied Network Science     Open Access  
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 4)
Arab Journal of Mathematical Sciences     Open Access   (Followers: 2)
Arabian Journal of Mathematics     Open Access   (Followers: 2)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 1)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4)
Archive of Numerical Software     Open Access  
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4)
Arkiv för Matematik     Hybrid Journal   (Followers: 1)
Arnold Mathematical Journal     Hybrid Journal   (Followers: 1)
Artificial Satellites : The Journal of Space Research Centre of Polish Academy of Sciences     Open Access   (Followers: 19)
Asia-Pacific Journal of Operational Research     Hybrid Journal   (Followers: 3)
Asian Journal of Algebra     Open Access   (Followers: 1)
Asian Journal of Current Engineering & Maths     Open Access  
Asian-European Journal of Mathematics     Hybrid Journal   (Followers: 2)
Australian Mathematics Teacher, The     Full-text available via subscription   (Followers: 7)
Australian Primary Mathematics Classroom     Full-text available via subscription   (Followers: 2)
Australian Senior Mathematics Journal     Full-text available via subscription   (Followers: 1)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Axioms     Open Access  
Baltic International Yearbook of Cognition, Logic and Communication     Open Access  
Basin Research     Hybrid Journal   (Followers: 3)
BIBECHANA     Open Access  
BIT Numerical Mathematics     Hybrid Journal  
BoEM - Boletim online de Educação Matemática     Open Access  
Boletim Cearense de Educação e História da Matemática     Open Access  
Boletim de Educação Matemática     Open Access  
Boletín de la Sociedad Matemática Mexicana     Hybrid Journal  
Bollettino dell'Unione Matematica Italiana     Full-text available via subscription   (Followers: 1)
British Journal of Mathematical and Statistical Psychology     Full-text available via subscription   (Followers: 21)
Bruno Pini Mathematical Analysis Seminar     Open Access  
Buletinul Academiei de Stiinte a Republicii Moldova. Matematica     Open Access   (Followers: 7)
Bulletin des Sciences Mathamatiques     Full-text available via subscription   (Followers: 4)
Bulletin of Dnipropetrovsk University. Series : Communications in Mathematical Modeling and Differential Equations Theory     Open Access   (Followers: 1)
Bulletin of Mathematical Sciences     Open Access   (Followers: 1)
Bulletin of the Brazilian Mathematical Society, New Series     Hybrid Journal  
Bulletin of the London Mathematical Society     Hybrid Journal   (Followers: 3)
Bulletin of the Malaysian Mathematical Sciences Society     Hybrid Journal  
Calculus of Variations and Partial Differential Equations     Hybrid Journal  
Canadian Journal of Science, Mathematics and Technology Education     Hybrid Journal   (Followers: 18)
Carpathian Mathematical Publications     Open Access   (Followers: 1)
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal  
CHANCE     Hybrid Journal   (Followers: 5)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
ChemSusChem     Hybrid Journal   (Followers: 7)
Chinese Annals of Mathematics, Series B     Hybrid Journal  
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
Chinese Journal of Mathematics     Open Access  
Clean Air Journal     Full-text available via subscription   (Followers: 2)
Cogent Mathematics     Open Access   (Followers: 2)
Cognitive Computation     Hybrid Journal   (Followers: 4)
Collectanea Mathematica     Hybrid Journal  
College Mathematics Journal     Full-text available via subscription   (Followers: 2)
COMBINATORICA     Hybrid Journal  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 13)
Commentarii Mathematici Helvetici     Hybrid Journal   (Followers: 1)
Communications in Contemporary Mathematics     Hybrid Journal  
Communications in Mathematical Physics     Hybrid Journal   (Followers: 1)
Communications On Pure & Applied Mathematics     Hybrid Journal   (Followers: 3)
Complex Analysis and its Synergies     Open Access   (Followers: 2)
Complex Variables and Elliptic Equations: An International Journal     Hybrid Journal  
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 9)
Comptes Rendus Mathematique     Full-text available via subscription   (Followers: 1)
Computational and Applied Mathematics     Hybrid Journal   (Followers: 2)
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 4)
Computational Methods and Function Theory     Hybrid Journal  
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computers & Mathematics with Applications     Full-text available via subscription   (Followers: 5)
Concrete Operators     Open Access   (Followers: 4)
Confluentes Mathematici     Hybrid Journal  
COSMOS     Hybrid Journal  
Cryptography and Communications     Hybrid Journal   (Followers: 14)
Cuadernos de Investigación y Formación en Educación Matemática     Open Access  
Cubo. A Mathematical Journal     Open Access  
Czechoslovak Mathematical Journal     Hybrid Journal   (Followers: 1)
Demographic Research     Open Access   (Followers: 11)
Demonstratio Mathematica     Open Access  
Dependence Modeling     Open Access  
Design Journal : An International Journal for All Aspects of Design     Hybrid Journal   (Followers: 29)
Developments in Clay Science     Full-text available via subscription   (Followers: 1)
Developments in Mineral Processing     Full-text available via subscription   (Followers: 3)
Dhaka University Journal of Science     Open Access  
Differential Equations and Dynamical Systems     Hybrid Journal   (Followers: 2)
Discrete Mathematics     Hybrid Journal   (Followers: 7)
Discrete Mathematics & Theoretical Computer Science     Open Access  
Discrete Mathematics, Algorithms and Applications     Hybrid Journal   (Followers: 2)
Discussiones Mathematicae Graph Theory     Open Access   (Followers: 1)
Doklady Mathematics     Hybrid Journal  
Duke Mathematical Journal     Full-text available via subscription   (Followers: 1)
Edited Series on Advances in Nonlinear Science and Complexity     Full-text available via subscription  
Electronic Journal of Graph Theory and Applications     Open Access   (Followers: 2)
Electronic Notes in Discrete Mathematics     Full-text available via subscription   (Followers: 2)
Elemente der Mathematik     Full-text available via subscription   (Followers: 3)
Energy for Sustainable Development     Hybrid Journal   (Followers: 9)
Enseñanza de las Ciencias : Revista de Investigación y Experiencias Didácticas     Open Access  
Ensino da Matemática em Debate     Open Access  
Entropy     Open Access   (Followers: 5)
ESAIM: Control Optimisation and Calculus of Variations     Full-text available via subscription   (Followers: 1)
European Journal of Combinatorics     Full-text available via subscription   (Followers: 4)
European Journal of Mathematics     Hybrid Journal   (Followers: 1)
European Scientific Journal     Open Access   (Followers: 2)
Experimental Mathematics     Hybrid Journal   (Followers: 4)
Expositiones Mathematicae     Hybrid Journal   (Followers: 2)
Facta Universitatis, Series : Mathematics and Informatics     Open Access  
Fasciculi Mathematici     Open Access  
Finite Fields and Their Applications     Full-text available via subscription   (Followers: 4)
Fixed Point Theory and Applications     Open Access   (Followers: 1)
Formalized Mathematics     Open Access   (Followers: 2)
Foundations and Trends® in Econometrics     Full-text available via subscription   (Followers: 4)

        1 2 3 4 | Last

Journal Cover Discrete Mathematics, Algorithms and Applications
  [2 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1793-8309 - ISSN (Online) 1793-8317
   Published by World Scientific Homepage  [118 journals]
  • The linear 2-arboricity of sparse graphs
    • Authors: Yuanchao Li, Xiaoxue Hu
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      The linear [math]-arboricity [math] of a graph [math] is the least integer [math] such that [math] can be partitioned into [math] edge-disjoint forests, whose components are paths of length at most 2. In this paper, we study the linear [math]-arboricity of sparse graphs, and prove the following results: (1) let [math] be a 2-degenerate graph, we have [math]; (2) if [math], then [math]; (3) if [math], then [math]; (4) if [math], then [math]; (5) if [math], then [math].
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-07-03T08:25:25Z
      DOI: 10.1142/S1793830917500471
       
  • On the spectral radii and principal eigenvectors of uniform hypergraphs
    • Authors: Xuelian Si, Xiying Yuan
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Let [math] be a connected [math]-uniform hypergraph. The unique positive eigenvector [math] with [math] corresponding to spectral radius [math] is called the principal eigenvector of [math]. In this paper, we present some lower bounds for the spectral radius [math] and investigate the bounds of entries of the principal eigenvector of [math].
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-07-03T08:25:24Z
      DOI: 10.1142/S1793830917500483
       
  • Double vertex-edge domination
    • Authors: Balakrishna Krishnakumari, Mustapha Chellali, Yanamandram B. Venkatakrishnan
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      A vertex [math] of a graph [math] is said to ve-dominate every edge incident to [math], as well as every edge adjacent to these incident edges. A set [math] is a vertex-edge dominating set (double vertex-edge dominating set, respectively) if every edge of [math] is [math]-dominated by at least one vertex (at least two vertices) of [math]. The minimum cardinality of a vertex-edge dominating set (double vertex-edge dominating set, respectively) of [math] is the vertex-edge domination number [math] (the double vertex-edge domination number [math], respectively). In this paper, we initiate the study of double vertex-edge domination. We first show that determining the number [math] for bipartite graphs is NP-complete. We also prove that for every nontrivial connected graphs [math], [math], and we characterize the trees [math] with [math] or [math]. Finally, we provide two lower bounds on the double ve-domination number of trees and unicycle graphs in terms of the order [math], the number of leaves and support vertices, and we characterize the trees attaining the lower bound.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-06-19T11:09:15Z
      DOI: 10.1142/S1793830917500458
       
  • Switched signed graphs of integer additive set-valued signed graphs
    • Authors: N. K. Sudev, K. P. Chithra, K. A. Germina
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Let [math] denote a set of non-negative integers and [math] be its power set. An integer additive set-labeling (IASL) of a graph [math] is an injective set-valued function [math] such that the induced function [math] is defined by [math], where [math] is the sumset of [math] and [math]. An IASL of a signed graph [math] is an IASL of its underlying graph [math] together with the signature [math] defined by [math]. A marking of a signed graph is an injective map [math], defined by [math] for all [math]. Switching of signed graph is the process of changing the sign of the edges in [math] whose end vertices have different signs. In this paper, we discuss certain characteristics of the switched signed graphs of certain types of integer additive set-labeled signed graphs.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-06-19T11:09:14Z
      DOI: 10.1142/S1793830917500434
       
  • A novel connection between rough sets, hypergraphs and hypergroups
    • Authors: Tita Khalis Maryati, Bijan Davvaz
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      This paper presents a general framework for the study of the relations between hypergraphs and hypergroups based on approximation operators. Indeed, by a given hypergraph [math], an equivalence relation [math] on the set of vertices and using the notion of lower and upper approximations, we investigate two new hyperoperations on the set of vertices. In particular, by considering certain conditions on the equivalence relation [math], we obtain two related [math]-groups and we prove some results in this respect.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-06-19T11:09:13Z
      DOI: 10.1142/S1793830917500446
       
  • Near-optimal algorithm to count occurrences of subsequences of a given
           length
    • Authors: Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Daniel Ramirez-Acuna, Rene Peralta
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      For [math], define [math] as the set of integers [math]. Given an integer [math] and a string [math] of length [math] over [math], we count the number of times that each one of the [math] distinct strings of length [math] over [math] occurs as a subsequence of [math]. Our algorithm makes only one scan of [math] and solves the problem in time complexity [math] and space complexity [math]. These are very close to best possible.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-05-29T09:21:56Z
      DOI: 10.1142/S1793830917500422
       
  • Tetracyclic graphs with maximal Estrada index
    • Authors: Nader Jafari Rad, Akbar Jahanbani, Doost Ali Mojdeh
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      The Estrada index of a simple connected graph [math] of order [math] is defined as [math], where [math] are the eigenvalues of the adjacency matrix of [math]. In this paper, we characterize all tetracyclic graphs of order [math] with maximal Estrada index.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-05-26T08:07:33Z
      DOI: 10.1142/S1793830917500410
       
  • Analysis of interval programming in different environments and its
           application to fixed-charge transportation problem
    • Authors: Sudipta Midya, Sankar Kumar Roy
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      In this paper, we analyze the interval programming using interval and rough interval (RI). Interval programming is one of the tools to tackle uncertainty in mathematical programming. In the real world situations, we often encounter the cases where the data cannot be determined with certainty. So, the value of the data is assessed using an interval. Here, we consider that the parameters of the Fixed-Charge Transportation Problem (FCTP) are imprecise. In our proposed problem, uncertainties are considered in terms of interval and RI. We present a study of the FCTP using the interval programming. An example of the FCTP is included to show the effectiveness and usefulness of our proposed study. Finally, concluding remarks and future scopes of our paper are discussed.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-05-24T06:32:07Z
      DOI: 10.1142/S1793830917500409
       
  • A study on the modular sumset labeling of graphs
    • Authors: Sudev Naduvath
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      For a positive integer [math], let [math] be the set of all non-negative integers modulo [math] and [math] be its power set. A modular sumset valuation or a modular sumset labeling of a given graph [math] is an injective function [math] such that the induced function [math] defined by [math]. A modular sumset indexer of a graph [math] is an injective modular sumset valued function [math] such that the induced function [math] is also injective. In this paper, some properties and characteristics of this type of modular sumset labeling of graphs are being studied.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-05-02T09:18:57Z
      DOI: 10.1142/S1793830917500392
       
  • On an algorithm for receiving Sudoku matrices
    • Authors: Krasimir Yordzhev
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      This work examines the problem to describe an efficient algorithm for obtaining [math] Sudoku matrices. For this purpose, we define the concepts of [math] [math]-matrix and disjoint [math]-matrices. The paper, using the set-theoretical approach, describes an algorithm for obtaining [math]-tuples of [math] mutually disjoint [math] matrices. We show that in input [math] mutually disjoint [math] matrices, it is not difficult to receive a Sudoku matrix.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-04-25T10:15:16Z
      DOI: 10.1142/S1793830917500380
       
  • Constacyclic additive codes over finite fields
    • Authors: Taranjot Kaur, Anuradha Sharma
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Let [math] denote the finite field of order [math] and characteristic [math] [math] be a positive integer coprime to [math] and let [math] be an integer. In this paper, we develop the theory of constacyclic additive codes of length [math] over [math] and provide a canonical form decomposition for these codes. By placing ordinary, Hermitian and ∗ trace bilinear forms on [math] we determine some isodual constacyclic additive codes of length [math] over [math] Moreover, we explicitly determine basis sets of all self-orthogonal, self-dual and complementary-dual negacyclic additive codes of length [math] over [math] when [math] and enumerate these three class of codes for any integer [math] with respect to the aforementioned trace bilinear forms on [math]
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-04-13T01:50:26Z
      DOI: 10.1142/S1793830917500379
       
  • Evaluating the efficiency of a two-stage network structure with the use of
           fractional programming
    • Authors: Reza Ahmadzadeh, Sohrab Kordrostami, Alireza Amirteimoori
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Recently, network data envelopment analysis (NDEA) models have been developed to evaluate the efficiency of decision making units (DMUs) with internal structures. The network structures range from a simple two-stage process to a complex system. Looking through the literature on two-stage network structures, we see that Li et al. (2012) extended a model by assuming that the inputs to the second stage include both the outputs from the first stage and additional inputs to the second stage. In the current study, a model is proposed to evaluate the performance of these types of general two-stage network structures. To this end, we provide a linear model using fractional programming. In fact, previous models were often nonlinear models which were solved with heuristic methods. But, since the model presented in this paper is a linear model, then it can be solved easily as a linear programming problem. In order to clarify the newly proposed approach of this study, it has been applied to a case of regional Research and Development (R&D) system related to 30 provincial level regions in China and results have been compared with the heuristic method of Li et al. (2012).
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-03-31T09:28:24Z
      DOI: 10.1142/S1793830917500343
       
  • Some results on quadratic residue codes over the ring [math]
    • Authors: Jian Gao, Fanghui Ma
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Quadratic residue (QR) codes and their extensions over the finite non-chain ring [math] are studied, where [math], [math] is an odd prime and [math]. A class of Gray maps preserving the self-duality of linear codes from [math] to [math] is given. Under a special Gray map, a self-dual code [math] over [math], a formally self-dual code [math] over [math] and a formally self-dual code [math] over [math] are obtained from extended QR codes.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-03-31T09:28:24Z
      DOI: 10.1142/S1793830917500355
       
  • On transit functions in weighted graphs
    • Authors: M. V. Dhanyamol, Sunil Mathew
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Certain types of transit functions are studied in this paper. Strong intervals and strong gates are introduced. Since there are different metrics available in weighted graphs, different intervals can be studied. Strong intervals and strong convexity arising out of strong geodesics are considered and as a consequence the concept of gate is introduced. Several results related to these definitions are obtained.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-03-31T09:28:23Z
      DOI: 10.1142/S1793830917500367
       
  • On 4-regular 4-connected bipancyclic subgraphs of hypercubes
    • Authors: Y. M. Borse, S. R. Shaikh
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      We consider the problem of determining the possible orders for [math]-regular, [math]-connected and bipancyclic subgraphs of the hypercube [math]. For [math] and [math] the solution to the problem is known. In this paper, we solve the problem for [math] by proving that [math] has a 4-regular, 4-connected and bipancyclic subgraph on [math] vertices if and only if [math] or [math] is an even integer such that [math] Further, by improving a result of Ramras, we prove that a [math]-regular subgraph of [math] is either isomorphic to [math] or has at least [math] vertices. We also improve a result of Mane and Waphare regarding the existence of a [math]-regular, [math]-connected and bipancyclic subgraph of [math] Some applications of our results are given.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-03-21T03:07:00Z
      DOI: 10.1142/S179383091750032X
       
  • Narumi–Katayama index of total transformation graphs
    • Authors: Nilanjan De
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      The Narumi–Katayama index of a graph was introduced in 1984 for representing the carbon skeleton of a saturated hydrocarbons and is defined as the product of degrees of all the vertices of the graph. In this paper, we examine the Narumi–Katayama index of different total transformation graphs.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-03-21T03:07:00Z
      DOI: 10.1142/S1793830917500331
       
  • Radio [math]-chromatic number of cycles for large [math]
    • Authors: Nathaniel Karst, Joshua Langowitz, Jessica Oehrlein, Denise Sakai Troxell
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      For a positive integer [math], a radio [math]-labeling of a graph [math] is a function [math] from its vertex set to the non-negative integers such that for all pairs of distinct vertices [math] and [math], we have [math] where [math] is the distance between the vertices [math] and [math] in [math]. The minimum span over all radio [math]-labelings of [math] is called the radio [math]-chromatic number and denoted by [math]. The most extensively studied cases are the classic vertex colorings ([math]), [math](2,1)-labelings ([math]), radio labelings ([math], the diameter of [math]), and radio antipodal labelings ([math]. Determining exact values or tight bounds for [math] is often non-trivial even within simple families of graphs. We provide general lower bounds for [math] for all cycles [math] when [math] and show that these bounds are exact values when [math].
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-03-07T08:32:32Z
      DOI: 10.1142/S1793830917500318
       
  • Perfect domination and small cycles
    • Authors: Minghui Jiang, Yong Zhang
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      We study the parameterized complexity of several problems related to perfect domination in graphs with or without small cycles. When parameterized by the solution size, these problems are W-hard in graphs with girth at most four, but are fixed-parameter tractable in graphs with girth at least five.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-03-02T07:59:38Z
      DOI: 10.1142/S1793830917500306
       
  • Finding defectives on a line by Random Docking and interval group tests
    • Authors: Peter Damaschke
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Suppose that some of the [math] elements of a totally ordered structure is defective, and several repair robots are at our disposal. They can dock at a random element, move at unit speed or leave, and send each other signals if there is no defective between them. We show that, by using only two robots that obey simple rules, the defective can be localized in [math] time, which is also optimal. A variation of our strategy needs three robots but has a more predictable behavior. The model is motivated by a conjectured DNA repair mechanism, and it combines group testing with geometric search.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-24T11:40:48Z
      DOI: 10.1142/S179383091750029X
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.80.158.127
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016