Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Discrete Mathematics, Algorithms and Applications cover

Volume 12, Issue 04 (August 2020)

Review Paper
No Access
Blockchain applications, challenges and evaluation: A survey
  • 2030001

https://doi.org/10.1142/S1793830920300015

Research Papers
No Access
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
  • 2050035

https://doi.org/10.1142/S1793830920500354

Research Papers
No Access
A separator-based method for generating weakly chordal graphs
  • 2050039

https://doi.org/10.1142/S1793830920500391

Research Papers
No Access
Distance-based indices of complete m-ary trees
  • 2050041

https://doi.org/10.1142/S179383092050041X

Research Papers
No Access
Geodetic global domination in corona and strong product of graphs
  • 2050043

https://doi.org/10.1142/S1793830920500433

Research Papers
No Access
The double Roman domination number of generalized Sierpiński graphs
  • 2050047

https://doi.org/10.1142/S1793830920500470

Research Papers
No Access
Starter sequences and M-fold starter sequences: How can you begin?
  • 2050048

https://doi.org/10.1142/S1793830920500482

Research Papers
No Access
An algorithm to recognize weak roman domination stable trees under vertex deletion
  • 2050049

https://doi.org/10.1142/S1793830920500494

Research Papers
No Access
A note on Steiner reciprocal degree distance
  • 2050050

https://doi.org/10.1142/S1793830920500500

Research Papers
No Access
Isomorphisms of bi-Cayley graphs on Dihedral groups
  • 2050051

https://doi.org/10.1142/S1793830920500512

Research Papers
No Access
The minimum eccentric distance sum of trees with given distance k-domination number
  • 2050052

https://doi.org/10.1142/S1793830920500524

Research Papers
No Access
The strong nonsplit domination polynomial of some graphs
  • 2050053

https://doi.org/10.1142/S1793830920500536

Research Papers
No Access
Wiener index of unicycle graphs with given number of even degree vertices
  • 2050054

https://doi.org/10.1142/S1793830920500548

Research Papers
No Access
The integer {k}-domination number of circulant graphs
  • 2050055

https://doi.org/10.1142/S179383092050055X

Research Papers
No Access
Unique chords of unique cycles in 3-connected planar graphs
  • 2050056

https://doi.org/10.1142/S1793830920500561