for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> MATHEMATICS (Total: 867 journals)
    - APPLIED MATHEMATICS (69 journals)
    - GEOMETRY AND TOPOLOGY (19 journals)
    - MATHEMATICS (645 journals)
    - MATHEMATICS (GENERAL) (40 journals)
    - NUMERICAL ANALYSIS (19 journals)
    - PROBABILITIES AND MATH STATISTICS (75 journals)

MATHEMATICS (645 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: 6)
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: 10)
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: 5)
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: 9)
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: 6)
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: 2)
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: 9)
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: 4)
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: 17)
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: 20)
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: 17)
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: 1)
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: 12)
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: 28)
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: 4)
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: 3)
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]
  • On an algorithm for receiving Sudoku matrices
    • 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
    • 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
    • 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]
    • 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
    • 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
    • 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
    • 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]
    • 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
    • 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
    • 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
       
  • A characterization of some graphs with metric dimension two
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      A set [math] is called a resolving set, if for each pair of distinct vertices [math] there exists [math] such that [math], where [math] is the distance between vertices [math] and [math]. The cardinality of a minimum resolving set for [math] is called the metric dimension of [math] and is denoted by [math]. A [math]-tree is a chordal graph all of whose maximal cliques are the same size [math] and all of whose minimal clique separators are also all the same size [math]. A [math]-path is a [math]-tree with maximum degree [math], where for each integer [math], [math], there exists a unique pair of vertices, [math] and [math], such that [math]. In this paper, we prove that if [math] is a [math]-path, then [math]. Moreover, we provide a characterization of all [math]-trees with metric dimension two.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-17T08:08:11Z
      DOI: 10.1142/S1793830917500276
       
  • Secure vertex cover of a graph
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      We study the problem of using mobile guards to defend the vertices of a graph [math] against a single attack on its vertices. A vertex cover of a graph [math] is a set [math] such that for each edge [math], at least one of [math] or [math] is in [math]. The minimum cardinality of a vertex cover is termed the vertex covering number and it is denoted by [math]. In this context, we introduce a new protection strategy called the secure vertex cover[math]SVC[math] problem, where the guards are placed at the vertices of a graph, in order to protect the graph against a single attack on its vertices. We are concerned with the protection of [math] against a single attack, using at most one guard per vertex and require the set of guarded vertices to be a vertex cover. In addition, if any guard moves along an edge to deal with an attack to an unguarded vertex, then the resulting placement of guards must also form a vertex cover. Formally, this protection strategy defends the vertices of a graph against a single attack and simultaneously protects the edges. We define a SVC to be a set [math] such that [math] is a vertex cover and for each [math], there exists a [math] such that [math] is a vertex cover. The minimum cardinality of an SVC is called the secure vertex covering number and it is denoted by [math]. In this paper, a few properties of SVC of a graph are studied and specific values of [math] for few classes of well-known graphs are evaluated.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-17T08:08:08Z
      DOI: 10.1142/S1793830917500264
       
  • On the strongly annihilating-ideal graph of a commutative ring
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Let [math] be a commutative ring with identity and [math] be the set of ideals with nonzero annihilator. The strongly annihilating-ideal graph of [math] is defined as the graph [math] with the vertex set [math] and two distinct vertices [math] and [math] are adjacent if and only if [math] and [math]. It is proved that [math] is connected with diameter at most two and with girth at most four, if it contains a cycle. Moreover, we characterize all rings whose strongly annihilating-ideal graphs are complete or star. Furthermore, we study the affinity between strongly annihilating-ideal graph and annihilating-ideal graph (a well-known graph with the same vertices and two distinct vertices [math] are adjacent if and only if [math]) associated with a commutative ring.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-17T08:08:07Z
      DOI: 10.1142/S1793830917500288
       
  • More on the Estrada indices of trees
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Let [math] be the set of trees with [math] vertices. The first six trees with the maximal Estrada indices in [math] with [math] were previously reported. A new transformation for studying the Estrada index is introduced. Then, with the aid of the new transformation, we completely deduce the 7th to the 13th trees with the maximal Estrada indices in [math] with [math]. Furthermore, for the trees in [math] with [math], we obtain the relationship among three decreasing orders, namely, by their largest Estrada indices, by their largest eigenvalues, and by their largest resolvent Estrada indices, respectively.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-10T05:53:02Z
      DOI: 10.1142/S1793830917500252
       
  • Anti-Ramsey numbers for matchings in regular bipartite graphs
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Let [math] be a family of graphs. The anti-Ramsey number [math] for [math] in the graph [math] is the maximum number of colors in an edge coloring of [math] that does not have any rainbow copy of any graph in [math]. In this paper, we consider the anti-Ramsey number for matchings in regular bipartite graphs and determine its value under several conditions.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-10T05:53:01Z
      DOI: 10.1142/S1793830917500197
       
  • On the size of paged recursive trees
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      A paged recursive tree is constructed as a recursive tree except that it depends on an integer parameter [math] representing a page capacity, small subtrees with size [math]. We investigate the number of nodes [math] (size of the tree) in paged recursive trees built from labels [math]. The expectation and variance of [math] are derived, and it is also shown that [math] is asymptotically normal. Zn = Nn − n/b (3b+1)(b−1)n b2(b+1) 𝒟 → 𝒩(0, 1), as [math] by applying the contraction method.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-10T05:53:00Z
      DOI: 10.1142/S1793830917500215
       
  • Roman domination and 2-independence in trees
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      A Roman dominating function (RDF) on a graph [math] is a function [math] satisfying the condition that every vertex [math] with [math] is adjacent to at least one vertex [math] of [math] for which [math]. The weight of a RDF is the sum [math], and the minimum weight of a RDF [math] is the Roman domination number [math]. A subset [math] of [math] is a [math]-independent set of [math] if every vertex of [math] has at most one neighbor in [math] The maximum cardinality of a [math]-independent set of [math] is the [math]-independence number [math] Both parameters are incomparable in general, however, we show that if [math] is a tree, then [math]. Moreover, all extremal trees attaining equality are characterized.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-10T05:52:59Z
      DOI: 10.1142/S1793830917500239
       
  • New and improved results on the signed (total) k-domination number of
           graphs
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      In this paper, we study the signed [math]-domination and its total version in graphs. By a simple uniform approach we give some new upper and lower bounds on these two parameters of a graph in terms of several different graph parameters. In this way, we can improve and generalize some results in literature. Moreover, we make use of the well-known theorem of Turán [On an extremal problem in graph theory, Math. Fiz. Lapok 48 (1941) 436–452] to bound the signed total [math]-domination number, [math], of a [math]-free graph [math] for [math].
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-10T05:52:59Z
      DOI: 10.1142/S1793830917500240
       
  • On ordinary and weighted Harary indices of Mycielski graphs
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      The Mycielski’s construction is a well-known construction on graphs which transforms a [math]-chromatic triangle-free graph [math] into a [math]-chromatic triangle-free graph [math] which is called the Mycielski graph of [math]. In this paper, we compute the Harary index, additively weighted Harary index, and multiplicatively weighted Harary index of the Mycielski graph of any simple connected graph with girth greater than 6.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-10T05:52:57Z
      DOI: 10.1142/S1793830917500227
       
  • Random graph languages
    • Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      There tend to be no related researches regarding the relationships between graph theory and languages ever since the concept of graph-semigroup was first proposed in 1991. In 2011, after finding out the inner co-relations among digraphs, undirected graphs and languages, we proposed certain concepts including undirected graph language and digraph language; moreover, in 2014, we proposed a broaden concept–(V,R)-language and proved: (1) both undirected graph language and digraph language are (V,R)-languages; (2) both undirected graph language and digraph language are regular languages; (3) natural languages are regular languages. In this paper, we propose a new concept–Random Graph Language and build the relationships between random graph and language, which provides researchers with the possibility to do research about languages by using random graph theory.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-02-10T05:52:56Z
      DOI: 10.1142/S1793830917500203
       
  • Coefficient of domination in graph
    • Authors: Angsuman Das
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      This paper introduces a new domination parameter called coefficient of domination of a graph, which measures the maximum possible efficiency of domination for the given graph. It is evaluated for various classes of graphs and different bounds are proposed. Finally, Nordhaus–Gaddum type inequalities are established for coefficient of domination of a graph and its complement.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-01-26T08:36:20Z
      DOI: 10.1142/S1793830917500185
       
  • A new notion of convexity in digraphs with an application to Bayesian
           networks
    • Authors: Francesco M. Malvestuto
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      We introduce a new notion of convexity in digraphs, which we call incoming-path convexity, and prove that the incoming-path convexity space of a digraph is a convex geometry (that is, it satisfies the Minkowski–Krein–Milman property) if and only if the digraph is acyclic. Moreover, we prove that incoming-path convexity is adequate to characterize collapsibility of models generated by Bayesian networks. Based on these results, we also provide simple linear algorithms to solve two topical problems on Markov properties of a Bayesian network (that is, on conditional independences valid in a Bayesian network).
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-01-10T06:08:36Z
      DOI: 10.1142/S1793830917500161
       
  • On covering radius of codes over [math] where [math] using chinese
           euclidean distance
    • Authors: P. Chella Pandian
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      In this paper, we give lower and upper bounds on the covering radius of codes over the ring [math] where [math] with respect to Chinese Euclidean distance and also obtain the covering radius of various Repetition codes, Simplex codes of [math]-Type code and [math]-Type code. We give bounds on the covering radius for MacDonald codes of both types over [math]
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2017-01-10T06:08:36Z
      DOI: 10.1142/S1793830917500173
       
  • A note on iterated galileo sequences
    • Authors: Ömer Eğecioğlu
      Abstract: Discrete Mathematics, Algorithms and Applications, Ahead of Print.
      Galileo sequences are generalizations of a simple sequence of integers that Galileo used in early 17th century for describing his law of falling bodies. The curious property he noted happens to be exactly what is needed to quantify his observation that the acceleration of falling bodies is uniform. Among the generalizations and extensions later given are iterated Galileo sequences. We show that these are closely related to polynomials that arise in enumerating integers by their Hamming weight.
      Citation: Discrete Mathematics, Algorithms and Applications
      PubDate: 2016-12-23T02:18:57Z
      DOI: 10.1142/S179383091750015X
       
 
 
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.162.96.103
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016