Discrete Mathematics Letters

Research Published in Pakistan

Search Pakistan Science Abstracts by publication details and ISSN to explore peer-reviewed journals and conference proceedings published in Pakistan.

Showing articles published in Discrete Mathematics Letters. Remove the Journal filter below to search the whole database.
Pakistan Science Abstract

Browse this publication by year

ISSN 2664-2557 · 246 indexed records

2021 articles

  1. Atom-bond connectivity index of graphs: a review over extremal results and bounds
  2. Some results on an encryption method using subset-sums of pseudo-recursive sequences
  3. Symmetric polynomials associated with numerical semigroups
  4. On the normalized (distance) Laplacian spectrum of linear dependence graph of a finite- dimensional vector space
  5. Estimating the PI-Estrada index of graphs
  6. When metric and upper dimensions differ in zero divisor graphs of commutative rings
  7. Computing 2-twinless blocks
  8. An upper bound for the Laplacian index of a signed graph
  9. Counting clusters in a coloring grid
  10. Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
  11. Binomial sums about Bernoulli, Euler and Hermite polynomials
  12. On the pancyclicity of 1-tough graphs
  13. New directions in Ramsey theory
  14. A survey of line digraphs and generalizations*
  15. Plane integral drawings of the platonic solid graphs with triangle faces
  16. On 4-colorable robust critical graphs
  17. Generalized target functions on trees
  18. A brief history of edge-colorings - with personal reminiscences
  19. Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5 - e)-free subgraphs
  20. Productive and sum graph labelings: a survey
  21. Vertex sequences in graphs
  22. Perfect Roman domination in middle graphs
  23. Restricted coloring of 1-by-n chessboards
  24. The average domination polynomial of graphs is unimodal
  25. An asymptotic relation between the wirelength of an embedding and the Wiener index
  26. Vertex identification in trees
  27. On the non-existence of Abelian Moore Cayley graphs with excess one
  28. Bounds on graph energy and Randic energy
  29. Hybrid convolutions on Pell and Lucas polynomials
  30. Minimum 2-vertex strongly biconnected spanning directed subgraph problem
  31. Variations on Hammersley’s interacting particle process
  32. Computing the dependence of graph energy on nullity: The method of siblings
  33. The Sombor index of trees and unicyclic graphs with given maximum degree
  34. On spectral radius of the generalized distance matrix of a graph
  35. Several closed and determinantal forms for convolved Fibonacci numbers
  36. On hyper-Hamiltonian Cartesian product of undirected cycles
  37. Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths
  38. On the structure of graphs with integer Sombor indices