default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Algorithms and Applications, Volume 9
Volume 9, Number 1, February 2017
- Sumit Kumar Jha:
Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm. 1750001:1-1750001:6 - Reza Alimoradi:
A new certificateless multiple key agreement scheme. 1750002:1-1750002:15 - S. Balamurugan:
Changing and unchanging isolate domination: Edge removal. 1750003:1-1750003:9 - I. Keerthi Asir, S. Athisayanathan:
Clique-to-vertex monophonic distance in graphs. 1750004:1-1750004:18 - Haixia Guo, You Gao:
Class dimension of association schemes in singular linear spaces. 1750005:1-1750005:5 - J. John, N. Arianayagam:
The detour domination number of a graph. 1750006:1-1750006:7 - Maryam Roozbayani, Hamidreza Maimani:
Identifying codes and watching systems in Kneser graphs. 1750007:1-1750007:9 - Ramanjit Kumar, Surinder Pal Singh
:
SIG-dimension conjecture proved for graphs having a perfect matching. 1750008:1-1750008:24 - Eunjeong Yi:
Disjunctive total domination in permutation graphs. 1750009:1-1750009:20 - Taher Abualrub, Nuh Aydin:
Additive cyclic codes over mixed alphabets and the football pool problem. 1750010:1-1750010:13 - Jing Jin, Yiming Wei:
A note on 3-choosability of plane graphs under distance restrictions. 1750011:1-1750011:6 - Lin-Zhi Shen, Fang-Wei Fu:
2ℓ-Incorrigible set distributions of some linear codes by the finite geometry. 1750012:1-1750012:8 - Yuehua Bu, Hongguo Zhu:
Strong edge-coloring of subcubic planar graphs. 1750013:1-1750013:11 - Johan Kok, N. K. Sudev, U. Mary:
On chromatic Zagreb indices of certain graphs. 1750014:1-1750014:14
Volume 9, Number 2, April 2017
- Ömer Egecioglu:
A note on iterated galileo sequences. 1750015:1-1750015:4 - Francesco M. Malvestuto:
A new notion of convexity in digraphs with an application to Bayesian networks. 1750016:1-1750016:22 - P. Chella Pandian:
On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance. 1750017:1-1750017:8 - Angsuman Das:
Coefficient of domination in graph. 1750018:1-1750018:12 - Zemin Jin, Oothan Nweit, Kaijun Wang, Yuling Wang:
Anti-Ramsey numbers for matchings in regular bipartite graphs. 1750019:1-1750019:7 - Haizhong Shi, Yue Shi:
Random graph languages. 1750020:1-1750020:11 - Mehri Javanian:
On the size of paged recursive trees. 1750021:1-1750021:10 - Mahdieh Azari:
On ordinary and weighted Harary indices of Mycielski graphs. 1750022:1-1750022:14 - Nacéra Meddah, Mustapha Chellali:
Roman domination and 2-independence in trees. 1750023:1-1750023:6 - Doost Ali Mojdeh, Babak Samadi:
New and improved results on the signed (total) k-domination number of graphs. 1750024:1-1750024:10 - Wen-Huan Wang:
More on the Estrada indices of trees. 1750025:1-1750025:10 - P. Roushini Leely Pushpam, Chitra Suseendran:
Secure vertex cover of a graph. 1750026:1-1750026:17 - Ali Behtoei, Akbar Davoodi, Mohsen Jannesari, Behnaz Omoomi:
A characterization of some graphs with metric dimension two. 1750027:1-1750027:15 - N. Kh. Tohidi, Mohammad Javad Nikmehr, Reza Nikandish:
On the strongly annihilating-ideal graph of a commutative ring. 1750028:1-1750028:13
Volume 9, Number 3, June 2017
- Peter Damaschke:
Finding defectives on a line by random docking and interval group tests. 1750029:1-1750029:11 - Minghui Jiang, Yong Zhang:
Perfect domination and small cycles. 1750030:1-1750030:11 - Nathaniel J. Karst, Joshua Langowitz, Jessica Oehrlein, Denise Sakai Troxell:
Radio k-chromatic number of cycles for large k. 1750031:1-1750031:20 - Y. M. Borse, S. R. Shaikh:
On 4-regular 4-connected bipancyclic subgraphs of hypercubes. 1750032:1-1750032:12 - Nilanjan De:
Narumi-Katayama index of total transformation graphs. 1750033:1-1750033:17 - Reza Ahmadzadeh, Sohrab Kordrostami, Alireza Amirteimoori:
Evaluating the efficiency of a two-stage network structure with the use of fractional programming. 1750034:1-1750034:14 - Jian Gao, Fanghui Ma:
Some results on quadratic residue codes over the ring Fp + vFp + v2Fp + v3Fp. 1750035:1-1750035:9 - M. V. Dhanyamol, Sunil Mathew:
On transit functions in weighted graphs. 1750036:1-1750036:23 - Taranjot Kaur, Anuradha Sharma:
Constacyclic additive codes over finite fields. 1750037:1-1750037:35 - Krasimir Yordzhev:
On an algorithm for receiving Sudoku matrices. 1750038:1-1750038:8 - Sudev Naduvath:
A study on the modular sumset labeling of graphs. 1750039:1-1750039:16 - Sudipta Midya, Sankar Kumar Roy:
Analysis of interval programming in different environments and its application to fixed-charge transportation problem. 1750040:1-1750040:17 - Nader Jafari Rad, Akbar Jahanbani, Doost Ali Mojdeh:
Tetracyclic graphs with maximal Estrada index. 1750041:1-1750041:18 - Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Daniel Ramirez-Acuna, René Peralta:
Near-optimal algorithm to count occurrences of subsequences of a given length. 1750042:1-1750042:10
Volume 9, Number 4, August 2017
- Sudev Naduvath, K. P. Chithra, K. Augustine Germina:
Switched signed graphs of integer additive set-valued signed graphs. 1750043:1-1750043:10 - Tita Khalis Maryati, Bijan Davvaz:
A novel connection between rough sets, hypergraphs and hypergroups. 1750044:1-1750044:17 - Balakrishna Krishnakumari, Mustapha Chellali, Yanamandram B. Venkatakrishnan:
Double vertex-edge domination. 1750045:1-1750045:11 - Jinto James, K. Augustine Germina, P. Shaini:
Learning graphs and 1-uniform dcsl graphs. 1750046:1-1750046:9 - Yuanchao Li, Xiaoxue Hu:
The linear 2-arboricity of sparse graphs. 1750047:1-1750047:10 - Xuelian Si, Xiying Yuan:
On the spectral radii and principal eigenvectors of uniform hypergraphs. 1750048:1-1750048:9 - Sarika Devhare, Vinayak Joshi:
Perfect non-commuting graphs of matrices over chains. 1750049:1-1750049:15 - Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami:
Global total Roman domination in graphs. 1750050:1-1750050:13 - Vinod Tyagi, Ambika Tyagi:
Byte protecting perfect burst code. 1750051:1-1750051:8 - Qirui Wang, Tianping Shuai, Wenbao Ai, Jianhua Yuan:
P4-equicoverable graphs which contain cycles with length at least 4. 1750052:1-1750052:16 - Angsuman Das:
Infinite graphs with finite dominating sets. 1750053:1-1750053:9 - Sudev Naduvath, K. P. Chithra, S. Satheesh, Johan Kok:
On certain parameters of equitable coloring of graphs. 1750054:1-1750054:11 - Lilian Markenzon, Christina Fraga Esteves Maciel Waga:
Counting and enumerating unlabeled split-indifference graphs. 1750055:1-1750055:8 - Hiroki Izumi, Sennosuke Watanabe, Yoshihide Watanabe:
Augmenting trail theorem for the maximum 1-2 matching problem. 1750056:1-1750056:7
Volume 9, Number 5, October 2017
- Tran Dan Thu:
Generic type of Ahlswede-Zhang style identities. 1750057:1-1750057:11 - Krishnan Selvakumar, P. Subbulakshmi, Jafar Amjadi:
On the genus of the graph associated to a commutative ring. 1750058:1-1750058:11 - (Withdrawn) New simple algorithms for computing the minimal polynomial of cos(2π/n). 1750059:1-1750059:9
- Farzad Shaveisi:
A neigborhood union condition for nonadjacent vertices in graphs. 1750060:1-1750060:14 - Blanca Isabel Niel:
Winding indexes of Max. and Min. Hamiltonians in N-Gons. 1750061:1-1750061:19 - Jyhmin Kuo, Hung-Lin Fu:
New bounds on the decycling number of generalized de Bruijn digraphs. 1750062:1-1750062:9 - Katharine L. M. Adamyk, Edward C. Holmes, G. R. Mayfield, Dennis J. Moritz, Marion Scheepers, Bridget Eileen Tenner, Helen C. Wauck:
Sorting permutations: Games, genomes, and cycles. 1750063:1-1750063:31 - Ali Ahmad:
Computation of certain topological properties of para-line graph of honeycomb networks and graphene. 1750064:1-1750064:16 - William F. Klostermeyer, Margaret-Ellen Messinger, Alejandro Angeli Ayello:
Disjoint dominating sets with a perfect matching. 1750065:1-1750065:20 - Muhammad Imran, Shehnaz Akhter:
Degree-based topological indices of double graphs and strong double graphs. 1750066:1-1750066:15 - Gek Ling Chia, Wanida Hemakul, Sirirat Singhun:
Graphs with cyclomatic number three having panconnected square. 1750067:1-1750067:14 - R. Vasanthi, K. Subramanian:
On the minimum vertex covering transversal dominating sets in graphs and their classification. 1750069:1-1750069:15 - Madeline Al Tahan, Bijan Davvaz:
Commutative single power cyclic hypergroups of order three and period two. 1750070:1-1750070:15
Volume 9, Number 6, December 2017
- Gruia Calinescu:
T-joins in strongly connected hypergraphs. 1750068:1-1750068:19 - Muhammad Naeem, Muhammad Kamran Siddiqui:
Total irregularity strength of disjoint union of isomorphic copies of generalized Petersen graph. 1750071:1-1750071:9 - Yi Zhang, Mei Lu:
d-matching in k-uniform hypergraphs. 1750072:1-1750072:8 - Ishwar Baidari, Preeti Savant:
On min-max distance degree index. 1750073:1-1750073:17 - A. Mallika, Rukhmoni Kala:
Rings whose cozero-divisor graph has crosscap number at most two. 1750074:1-1750074:13 - R. Rajarajachozhan, R. Sampathkumar:
Modular coloring of the Cartesian products Km□Kn, Km□Cn, and Km□Pn. 1750075:1-1750075:18 - Gurupada Maity, Sankar Kumar Roy:
Solving fuzzy transportation problem using multi-choice goal programming. 1750076:1-1750076:17 - Kairi Kangro, Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
Short note on the number of 1-ascents in dispersed Dyck paths. 1750077:1-1750077:8 - Jose Torres-Jimenez, Jose Carlos Perez-Torres, Gildardo Maldonado-Martinez:
hClique: An exact algorithm for maximum clique problem in uniform hypergraphs. 1750078:1-1750078:14 - Nopparat Pleanmani, Boyko Gyurov, Sayan Panma:
Partially composed property of generalized lexicographic product graphs. 1750079:1-1750079:11 - Pinkimani Goswami, Madan Mohan Singh, Bubu Bhuyan:
A new public key cryptosystem over ℤn2*. 1750080:1-1750080:11
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.
last updated on 2024-12-02 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
