Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 102 matches
- 2021
- J. Geetha, K. Somasundaram, Hung-Lin Fu:
Total colorings of circulant graphs. Discret. Math. Algorithms Appl. 13(5): 2150050:1-2150050:10 (2021) - V. Swaminathan, Raman Sundareswaran, D. Lakshmanaraj, P. Nataraj, L. Muthusubramanian:
Equitable fair domination in graphs. Discret. Math. Algorithms Appl. 13(6): 2150083:1-2150083:7 (2021) - Emanuele Bellini, Chiara Marcolla, Nadir Murru:
On the decoding of 1-Fibonacci error correcting codes. Discret. Math. Algorithms Appl. 13(5): 2150056:1-2150056:18 (2021) - Mohammed A. Abdlhusein:
Doubly connected bi-domination in graphs. Discret. Math. Algorithms Appl. 13(2): 2150009:1-2150009:10 (2021) - Mohammed A. Abdlhusein, Manal N. Al-Harere:
Total pitchfork domination and its inverse in graphs. Discret. Math. Algorithms Appl. 13(4): 2150038:1-2150038:11 (2021) - Alireza Abdollahi, Niloufar Zakeri:
Proof of a conjecture on spectral distance between cycles, paths and certain trees. Discret. Math. Algorithms Appl. 13(6): 2150073:1-2150073:9 (2021) - A. Mohammed Abid, T. R. Ramesh Rao:
On strict strong coloring of graphs. Discret. Math. Algorithms Appl. 13(4): 2150040:1-2150040:14 (2021) - Amita Samanta Adhya, Sukumar Mondal, Sambhu Charan Barman:
Minimum r-neighborhood covering set of permutation graphs. Discret. Math. Algorithms Appl. 13(6): 2150081:1-2150081:14 (2021) - Shahzad Ahmed:
On the maximum general sum-connectivity index of trees with a fixed order and maximum degree. Discret. Math. Algorithms Appl. 13(4): 2150042:1-2150042:13 (2021) - Manal N. Al-Harere, P. A. Khuda Bakhash:
Tadpole domination in duplicated graphs. Discret. Math. Algorithms Appl. 13(2): 2150003:1-2150003:9 (2021) - Ridho Alfarisi, Arika Indah Kristiana:
The local partition dimension of graphs. Discret. Math. Algorithms Appl. 13(3): 2150028:1-2150028:9 (2021) - Mohsen Alinejad, Kazem Khashyarmanesh:
Counting short cycles of (c, d)-regular bipartite graphs. Discret. Math. Algorithms Appl. 13(3): 2150022:1-2150022:21 (2021) - Sk Amanathulla, Madhumangal Pal:
L(3, 2, 1)-Labeling problems on trapezoid graphs. Discret. Math. Algorithms Appl. 13(5): 2150068:1-2150068:16 (2021) - D. Anusha, Johnson John, S. Joseph Robin:
The geodetic hop domination number of complementary prisms. Discret. Math. Algorithms Appl. 13(6): 2150077:1-2150077:15 (2021) - Azeddine Baalal, Khalid Hatim:
Discrete Laplace operator of 3-cochains. Discret. Math. Algorithms Appl. 13(1): 2150001:1-2150001:17 (2021) - Valentin P. Bakoev:
Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube. Discret. Math. Algorithms Appl. 13(3): 2150021:1-2150021:23 (2021) - S. Balamurugan, R. Antony Doss:
The edge signal number of a graph. Discret. Math. Algorithms Appl. 13(3): 2150024:1-2150024:12 (2021) - Subarsha Banerjee:
Laplacian spectra of Coprime Graph of finite cyclic and Dihedral groups. Discret. Math. Algorithms Appl. 13(3): 2150020:1-2150020:18 (2021) - Subarsha Banerjee:
The metric dimension & distance spectrum of non-commuting graph of dihedral group. Discret. Math. Algorithms Appl. 13(6): 2150082:1-2150082:13 (2021) - Arunwan Boripan, Somphong Jitman:
SRIM and SCRIM factors of xn + 1 over finite fields and their applications. Discret. Math. Algorithms Appl. 13(1): 2050098:1-2050098:20 (2021) - Mouna Boumezbeur, Sihem Mesnager, Kenza Guenda:
Linear codes from vectorial Boolean functions in the context of algebraic attacks. Discret. Math. Algorithms Appl. 13(3): 2150032:1-2150032:20 (2021) - Yue Hua Bu, Jiao Jiao Cao:
2-Distance coloring of planar graph. Discret. Math. Algorithms Appl. 13(2): 2150007:1-2150007:15 (2021) - Hanlin Chen, Hechao Liu, Qiqi Xiao, Jinlian Zhang:
Extremal phenylene chains with respect to the Mostar index. Discret. Math. Algorithms Appl. 13(6): 2150075:1-2150075:27 (2021) - Giampiero Chiaselotti, Tommaso Gentile, Federico G. Infusino:
Some classifications of graphs with respect to a set adjacency relation. Discret. Math. Algorithms Appl. 13(1): 2050089:1-2050089:31 (2021) - Sandeep Dalal, Jitender Kumar:
On enhanced power graphs of certain groups. Discret. Math. Algorithms Appl. 13(1): 2050099:1-2050099:18 (2021) - Meenakshi Devi, R. S. Raja Durai, Ashwini Kumar, Hongjun Xu:
Some important results on 풯-Direct codes. Discret. Math. Algorithms Appl. 13(3): 2150067:1-2150067:12 (2021) - K. Dhanalakshmi, K. Augustine Germina, J. Amalorpava Jerline, L. Benedict Michael Raj:
Results on uniquely colorable digraphs. Discret. Math. Algorithms Appl. 13(6): 2150071:1-2150071:11 (2021) - R. Dharmarajan, D. Ramachandran:
The Erdős-Faber-Lovász conjecture for the class of δEFL graphs. Discret. Math. Algorithms Appl. 13(4): 2150034:1-2150034:13 (2021) - Man Ding, Congying Han, Tiande Guo:
High generalization performance structured self-attention model for knapsack problem. Discret. Math. Algorithms Appl. 13(6): 2150076:1-2150076:18 (2021) - Charles Dominic, Jobish Vallikavungal Devassia:
3-Sequent achromatic sum of graphs. Discret. Math. Algorithms Appl. 13(4): 2150039:1-2150039:14 (2021)
skipping 72 more matches
loading more results
failed to load more results, please try again later
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).
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).
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 .
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.
retrieved on 2024-06-03 15:13 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint