Discrete Mathematics, Algorithms and Applications, Volume 13 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Discrete Mathematics, Algorithms and Applications

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 13, Number 1, February 2021

Research Paper

• 
  • 
  • 
  • 
  • 
    J. John, V. R. Sunil Kumar:
    The open detour number of a graph. 2050088:1-2050088:12
• 
  • 
  • 
  • 
  • 
    Giampiero Chiaselotti, Tommaso Gentile, Federico G. Infusino:
    Some classifications of graphs with respect to a set adjacency relation. 2050089:1-2050089:31
• 
  • 
  • 
  • 
  • 
    Sara Pouyandeh, Maryam Golriz, Mohammadreza Sorouhesh, Maryam Khademi:
    On domination number of Latin square graphs of finite cyclic groups. 2050090:1-2050090:8
• 
  • 
  • 
  • 
  • 
    B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan:
    A lower bound on the total vertex-edge domination number of a tree. 2050091:1-2050091:6
• 
  • 
  • 
  • 
  • 
    Oualid El Ghachi, Abdelghni Lakehal, Nasser Labani:
    On improving the construction of balanced incomplete block designs using planar near-rings. 2050092:1-2050092:13
• 
  • 
  • 
  • 
  • 
    Mehmet Akif Yetim:
    Coloring squares of graphs via vertex orderings. 2050093:1-2050093:9
• 
  • 
  • 
  • 
  • 
    P. Jeyalakshmi:
    Domination in signed graphs. 2050094:1-2050094:11
• 
  • 
  • 
  • 
  • 
    Sunny Kumar Sharma, Vijay Kumar Bhat:
    Metric dimension of heptagonal circular ladder. 2050095:1-2050095:17
• 
  • 
  • 
  • 
  • 
    Pandiaraja Duraisamy, Shanmugam Esakkimuthu:
    Linear programming approach for various domination parameters. 2050096:1-2050096:11
• 
  • 
  • 
  • 
  • 
    P. Roushini Leely Pushpam, K. Priya Bhanthavi:
    The stability of independent transversal domination in trees. 2050097:1-2050097:10
• 
  • 
  • 
  • 
  • 
    Arunwan Boripan, Somphong Jitman:
    SRIM and SCRIM factors of xn + 1 over finite fields and their applications. 2050098:1-2050098:20
• 
  • 
  • 
  • 
  • 
    Sandeep Dalal, Jitender Kumar:
    On enhanced power graphs of certain groups. 2050099:1-2050099:18
• 
  • 
  • 
  • 
  • 
    Hilal A. Ganie, Abdollah Alhevaz, Maryam Baghipur:
    On the sum of the generalized distance eigenvalues of graphs. 2050100:1-2050100:16
• 
  • 
  • 
  • 
  • 
    L. Shahbazi, Hossein Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
    Total k-rainbow reinforcement number in graphs. 2050101:1-2050101:16

Review Paper

• 
  • 
  • 
  • 
  • 
    Akul Rana:
    A survey on the domination of fuzzy graphs. 2130001:1-2130001:15

Research Paper

• 
  • 
  • 
  • 
  • 
    Azeddine Baalal, Khalid Hatim:
    Discrete Laplace operator of 3-cochains. 2150001:1-2150001:17

Volume 13, Number 2, April 2021

Research Paper

• 
  • 
  • 
  • 
  • 
    Fazal Hayat:
    On the maximum connective eccentricity index among k-connected graphs. 2150002:1-2150002:11
• 
  • 
  • 
  • 
  • 
    Manal N. Al-Harere, P. A. Khuda Bakhash:
    Tadpole domination in duplicated graphs. 2150003:1-2150003:9
• 
  • 
  • 
  • 
  • 
    Effat Soleimani, Hazhir Saberi, Niloofar Ayoobi-Yazdi:
    Optimized geometry of the carotid artery cross-section: Comparison between circular and elliptical approximations in B-mode ultrasound images. 2150004:1-2150004:15
• 
  • 
  • 
  • 
  • 
    Lu Zheng, Gui-Xian Tian, Shu-Yu Cui:
    Arithmetic-geometric energy of specific graphs. 2150005:1-2150005:15
• 
  • 
  • 
  • 
  • 
    Rana Khoeilar, Jafar Amjadi:
    Classification of rings with toroidal co-annihilating-ideal graphs. 2150006:1-2150006:16
• 
  • 
  • 
  • 
  • 
    Yue Hua Bu, Jiao Jiao Cao:
    2-Distance coloring of planar graph. 2150007:1-2150007:15
• 
  • 
  • 
  • 
  • 
    Parikshit Saikia, Sushanta Karmakar, Aris Pagourtzis:
    Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree. 2150008:1-2150008:48
• 
  • 
  • 
  • 
  • 
    Mohammed A. Abdlhusein:
    Doubly connected bi-domination in graphs. 2150009:1-2150009:10
• 
  • 
  • 
  • 
  • 
    Liliek Susilowati, Imroatus Sa'adah, Utami Dyah Purwati:
    On the joint product graphs with respect to dominant metric dimension. 2150010:1-2150010:11
• 
  • 
  • 
  • 
  • 
    B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan:
    Bounds on total edge domination number of a tree. 2150011:1-2150011:7
• 
  • 
  • 
  • 
  • 
    Min-Sheng Lin:
    Fast and simple algorithms for counting dominating sets in distance-hereditary graphs. 2150012:1-2150012:12
• 
  • 
  • 
  • 
  • 
    Danjun Huang, Jingran Qi:
    DP-coloring on planar graphs without given adjacent short cycles. 2150013:1-2150013:13
• 
  • 
  • 
  • 
  • 
    Masaaki Harada:
    On the existence of s-extremal singly even self-dual codes. 2150014:1-2150014:14
• 
  • 
  • 
  • 
  • 
    Shariefuddin Pirzada, M. Aijaz:
    On graphs with same metric and upper dimension. 2150015:1-2150015:10
• 
  • 
  • 
  • 
  • 
    Abdulla Eid, Sameh Ezzat:
    Abelian group factorization from cyclic and quasi-cyclic codes. 2150016:1-2150016:10
• 
  • 
  • 
  • 
  • 
    Tetsuo Yokoyama, Tomoo Yokoyama:
    Complete transition diagrams of generic Hamiltonian flows with a few heteroclinic orbits. 2150023:1-2150023:32

Volume 13, Number 3, June 2021

Research Paper

• 
  • 
  • 
  • 
  • 
    Mouna Boumezbeur, Sihem Mesnager, Kenza Guenda:
    Linear codes from vectorial Boolean functions in the context of algebraic attacks. 2150032:1-2150032:20
• 
  • 
  • 
  • 
  • 
    Jyoti Shetty, G. Sudhakara:
    Binomial incidence matrix of a semigraph. 2150017:1-2150017:19
• 
  • 
  • 
  • 
  • 
    Abolfazl Nikkhah, Bijan Davvaz:
    Hypergroups associated with hypergraphs. 2150018:1-2150018:11
• 
  • 
  • 
  • 
  • 
    C. Gopika, J. Geetha, K. Somasundaram:
    Weighted PI index of tensor product and strong product of graphs. 2150019:1-2150019:21
• 
  • 
  • 
  • 
  • 
    Subarsha Banerjee:
    Laplacian spectra of Coprime Graph of finite cyclic and Dihedral groups. 2150020:1-2150020:18
• 
  • 
  • 
  • 
  • 
    Valentin P. Bakoev:
    Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube. 2150021:1-2150021:23
• 
  • 
  • 
  • 
  • 
    Mohsen Alinejad, Kazem Khashyarmanesh:
    Counting short cycles of (c, d)-regular bipartite graphs. 2150022:1-2150022:21
• 
  • 
  • 
  • 
  • 
    S. Balamurugan, R. Antony Doss:
    The edge signal number of a graph. 2150024:1-2150024:12
• 
  • 
  • 
  • 
  • 
    R. Khoeilar, H. Shooshtari:
    Two-tree graphs with maximum general sum-connectivity index. 2150025:1-2150025:8
• 
  • 
  • 
  • 
  • 
    Saeed Shaebani, Saeed Kosari, Leila Asgharsharghi:
    The restrained k-rainbow reinforcement number of graphs. 2150026:1-2150026:12
• 
  • 
  • 
  • 
  • 
    R. Saranya, C. Durairajan:
    Codes from incidence matrices of some Bouwer graphs. 2150027:1-2150027:15
• 
  • 
  • 
  • 
  • 
    Ridho Alfarisi, Arika Indah Kristiana:
    The local partition dimension of graphs. 2150028:1-2150028:9
• 
  • 
  • 
  • 
  • 
    A. Sadiquali, P. Arul Paul Sudhahar, V. Lakshmana Gomathi Nayagam:
    Connected monophonic domination in graphs. 2150029:1-2150029:12
• 
  • 
  • 
  • 
  • 
    Behnaz Tolue, Amin Rafiei:
    The isodominism class of the graphs. 2150030:1-2150030:21
• 
  • 
  • 
  • 
  • 
    C. P. Anil Kumar:
    On the triangles in certain types of line arrangements. 2150031:1-2150031:23
• 
  • 
  • 
  • 
  • 
    Meenakshi Devi, R. S. Raja Durai, Ashwini Kumar, Hongjun Xu:
    Some important results on 풯-Direct codes. 2150067:1-2150067:12

Volume 13, Number 4, August 2021

Review Paper

• 
  • 
  • 
  • 
  • 
    Rong Jin, Weili Wu:
    Schemes of propagation models and source estimators for rumor source detection in online social networks: A short survey of a decade of research. 2130002:1-2130002:12

Research Paper

• 
  • 
  • 
  • 
  • 
    Konstantinos Papalamprou:
    On the basis pair graphs of signed-graphic matroids. 2150033:1-2150033:5
• 
  • 
  • 
  • 
  • 
    R. Dharmarajan, D. Ramachandran:
    The Erdős-Faber-Lovász conjecture for the class of δEFL graphs. 2150034:1-2150034:13
• 
  • 
  • 
  • 
  • 
    R. Saranya, C. Durairajan:
    Codes from incidence matrices of some regular graphs. 2150035:1-2150035:17
• 
  • 
  • 
  • 
  • 
    Ganquan Shi, Shuyang Gu, Weili Wu:
    k-Submodular maximization with two kinds of constraints. 2150036:1-2150036:15
• 
  • 
  • 
  • 
  • 
    Jismy Varghese, S. Aparna Lakshmanan:
    Italian domination on Mycielskian and Sierpinski graphs. 2150037:1-2150037:9
• 
  • 
  • 
  • 
  • 
    Mohammed A. Abdlhusein, Manal N. Al-Harere:
    Total pitchfork domination and its inverse in graphs. 2150038:1-2150038:11
• 
  • 
  • 
  • 
  • 
    Charles Dominic, Jobish Vallikavungal Devassia:
    3-Sequent achromatic sum of graphs. 2150039:1-2150039:14
• 
  • 
  • 
  • 
  • 
    A. Mohammed Abid, T. R. Ramesh Rao:
    On strict strong coloring of graphs. 2150040:1-2150040:14
• 
  • 
  • 
  • 
  • 
    Chunya Tisklang, Sayan Panma:
    Characterizations of Cayley graphs of finite transformation semigroups with restricted range. 2150041:1-2150041:11
• 
  • 
  • 
  • 
  • 
    Shahzad Ahmed:
    On the maximum general sum-connectivity index of trees with a fixed order and maximum degree. 2150042:1-2150042:13
• 
  • 
  • 
  • 
  • 
    P. Nataraj, Raman Sundareswaran, V. Swaminathan:
    Complementary equitably totally disconnected equitable domination in graphs. 2150043:1-2150043:12
• 
  • 
  • 
  • 
  • 
    Pandiaraja Duraisamy, Shanmugam Esakkimuthu, Rathinakumar Sivakumar:
    Linear programming formulation for some generalized domination parameters. 2150044:1-2150044:18
• 
  • 
  • 
  • 
  • 
    H. Naresh Kumar, Yanamandram B. Venkatakrishnan:
    On trees with domination number equal to edge-vertex roman domination number. 2150045:1-2150045:11
• 
  • 
  • 
  • 
  • 
    Tomás Vetrík:
    General eccentric distance sum of graphs. 2150046:1-2150046:17
• 
  • 
  • 
  • 
  • 
    Siwen Liu, Hongmin W. Du:
    Constant-approximation for minimum weight partial sensor cover. 2150047:1-2150047:8
• 
  • 
  • 
  • 
  • 
    S. Anandha Prabhavathy:
    Majority bad number. 2150048:1-2150048:7
• 
  • 
  • 
  • 
  • 
    Md. Zamilur Rahman, Asish Mukhopadhyay:
    Semi-dynamic algorithms for strongly chordal graphs. 2150049:1-2150049:42

Volume 13, Number 5, October 2021

Research Paper

• 
  • 
  • 
  • 
  • 
    J. Geetha, K. Somasundaram, Hung-Lin Fu:
    Total colorings of circulant graphs. 2150050:1-2150050:10
• 
  • 
  • 
  • 
  • 
    Wenjuan Zhou, Lei Sun:
    2-distance choice number of planar graphs with maximal degree no more than 4. 2150051:1-2150051:7
• 
  • 
  • 
  • 
  • 
    Azam Giahtazeh, Hamidreza Maimani, Ali Iranmanesh:
    On the Roman {2}-domatic number of graphs. 2150052:1-2150052:10
• 
  • 
  • 
  • 
  • 
    Akbar Jahanbani:
    Two-tree graphs with minimum sum-connectivity index. 2150053:1-2150053:8
• 
  • 
  • 
  • 
  • 
    Akbar Jahanbani:
    On the forgotten topological index of graphs. 2150054:1-2150054:10
• 
  • 
  • 
  • 
  • 
    Abolfazl Poureidi:
    On computing secure domination of trees. 2150055:1-2150055:15
• 
  • 
  • 
  • 
  • 
    Emanuele Bellini, Chiara Marcolla, Nadir Murru:
    On the decoding of 1-Fibonacci error correcting codes. 2150056:1-2150056:18
• 
  • 
  • 
  • 
  • 
    Reynaldo V. Mollejon, Sergio R. Canoy Jr.:
    Double hop dominating sets in graphs. 2150057:1-2150057:11
• 
  • 
  • 
  • 
  • 
    Tuga Mauritsius:
    Sum number of fans. 2150058:1-2150058:18
• 
  • 
  • 
  • 
  • 
    Eunjeong Yi:
    On the connected metric dimension of graphs and their complements. 2150059:1-2150059:17
• 
  • 
  • 
  • 
  • 
    S. Mohan, J. Geetha, K. Somasundaram:
    Total coloring of quasi-line graphs and inflated graphs. 2150060:1-2150060:11
• 
  • 
  • 
  • 
  • 
    Smitha Rose, Sudev Naduvath:
    Chromatic Zagreb and irregularity polynomials of graphs. 2150061:1-2150061:27
• 
  • 
  • 
  • 
  • 
    S. Anandha Prabhavathy:
    Majority Roman domination in graphs. 2150062:1-2150062:7
• 
  • 
  • 
  • 
  • 
    Chakradhar Padamutham, Venkata Subba Reddy Palagiri:
    Algorithmic aspects of total Roman {3}-domination in graphs. 2150063:1-2150063:14
• 
  • 
  • 
  • 
  • 
    Hicham Meraimi, Mustapha Chellali:
    Edge lifting and Roman domination in graphs. 2150064:1-2150064:13
• 
  • 
  • 
  • 
  • 
    P. Jeyalakshmi, K. Karuppasamy, S. Arockiaraj:
    Independent domination in signed graphs. 2150065:1-2150065:9
• 
  • 
  • 
  • 
  • 
    Meng Ji, Jing Wang:
    Some results on strong conflict-free connection number of graphs. 2150066:1-2150066:10
• 
  • 
  • 
  • 
  • 
    Sk Amanathulla, Madhumangal Pal:
    L(3, 2, 1)-Labeling problems on trapezoid graphs. 2150068:1-2150068:16

Volume 13, Number 6, December 2021

Research Paper

• 
  • 
  • 
  • 
  • 
    Chitra Suseendran, Fathima Tabrez:
    Star chromatic number of Harary graphs. 2150069:1-2150069:8
• 
  • 
  • 
  • 
  • 
    Yansheng Wu, Qin Yue:
    Further factorization of xn - 1 over a finite field (II). 2150070:1-2150070:34
• 
  • 
  • 
  • 
  • 
    K. Dhanalakshmi, K. Augustine Germina, J. Amalorpava Jerline, L. Benedict Michael Raj:
    Results on uniquely colorable digraphs. 2150071:1-2150071:11
• 
  • 
  • 
  • 
  • 
    D. Kiruba Packiarani, Y. Therese Sunitha Mary:
    The inverse strong nonsplit domination in graphs. 2150072:1-2150072:7
• 
  • 
  • 
  • 
  • 
    Alireza Abdollahi, Niloufar Zakeri:
    Proof of a conjecture on spectral distance between cycles, paths and certain trees. 2150073:1-2150073:9
• 
  • 
  • 
  • 
  • 
    E. Murugan, G. R. Sivaprakash:
    On the domination number of a graph and its shadow graph. 2150074:1-2150074:10
• 
  • 
  • 
  • 
  • 
    Hanlin Chen, Hechao Liu, Qiqi Xiao, Jinlian Zhang:
    Extremal phenylene chains with respect to the Mostar index. 2150075:1-2150075:27
• 
  • 
  • 
  • 
  • 
    Man Ding, Congying Han, Tiande Guo:
    High generalization performance structured self-attention model for knapsack problem. 2150076:1-2150076:18
• 
  • 
  • 
  • 
  • 
    D. Anusha, Johnson John, S. Joseph Robin:
    The geodetic hop domination number of complementary prisms. 2150077:1-2150077:15
• 
  • 
  • 
  • 
  • 
    Lu Zhang, Juan Liu:
    The linear 2-arboricity of 1-planar graphs without 3-cycles. 2150078:1-2150078:20
• 
  • 
  • 
  • 
  • 
    Kijung Kim:
    Middle domination and 2-independence in trees. 2150079:1-2150079:6
• 
  • 
  • 
  • 
  • 
    Fateme Movahedi:
    Bounds on the minimum edge dominating energy of induced subgraphs of a graph. 2150080:1-2150080:12
• 
  • 
  • 
  • 
  • 
    Amita Samanta Adhya, Sukumar Mondal, Sambhu Charan Barman:
    Minimum r-neighborhood covering set of permutation graphs. 2150081:1-2150081:14
• 
  • 
  • 
  • 
  • 
    Subarsha Banerjee:
    The metric dimension & distance spectrum of non-commuting graph of dihedral group. 2150082:1-2150082:13
• 
  • 
  • 
  • 
  • 
    V. Swaminathan, Raman Sundareswaran, D. Lakshmanaraj, P. Nataraj, L. Muthusubramanian:
    Equitable fair domination in graphs. 2150083:1-2150083:7
• 
  • 
  • 
  • 
  • 
    Khalid Hatim, Azeddine Baalal:
    Spectral gap of a weighted 3-simplicial complex. 2150084:1-2150084:26
• 
  • 
  • 
  • 
  • 
    Toshiya Itoh, Shuichi Miyazaki, Makoto Satake:
    Competitive analysis for two variants of online metric matching problem. 2150156:1-2150156:16
• 
  • 
  • 
  • 
  • 
    Thanakorn Prinyasart, Jittisak Rakbud, Suchat Samphavat:
    Solvability of a triple of binary relations with an application to Green's relations. 2250013:1-2250013:13

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: