default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Algorithms and Applications, Volume 10
Volume 10, Number 1, February 2018
- Zichong Chen:
The number of subtrees of trees with given diameter. 1850001:1-1850001:16 - Yanyan Luo, Weigen Yan:
Spectra of the generalized edge corona of graphs. 1850002:1-1850002:10 - Terry A. McKee:
Requiring adjacent chords in cycles. 1850003:1-1850003:7 - Kent D. Boklan:
A note on identities for elementary symmetric and power sum polynomials. 1850004:1-1850004:5 - K. Krishna Mohan Reddy, P. Renjith
, N. Sadagopan:
Listing all spanning trees in Halin graphs - sequential and Parallel view. 1850005:1-1850005:17 - Hanlin Chen, Hanyuan Deng:
The inverse sum indeg index of graphs with some given parameters. 1850006:1-1850006:9 - Saieed Akbari, Nazanin Alipourfard, Pegah Jandaghi, Mehrnoosh Sadat Mirtaheri:
On N2-vertex coloring of graphs. 1850007:1-1850007:7 - Muhammad Imran, Abdul Qudair Baig, Saima Rashid, Andrea Semanicová-Fenovcíková:
On the metric dimension and diameter of circulant graphs with three jumps. 1850008:1-1850008:17 - Jafar Amjadi, R. Khoeilar, Marzieh Soroudi:
A correction on the signed bad number. 1850009:1-1850009:3 - Jill K. Mathew, Sunil Mathew:
Monophonic convexity in weighted graphs. 1850010:1-1850010:10 - Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez:
New optimal covering arrays using an orderly algorithm. 1850011:1-1850011:16 - Purnima Gupta, Deepti Jain:
Bounds on 2-point set domination number of a graph. 1850012:1-1850012:15 - Jafar Amjadi, A. Alilou:
The co-annihilating graph of a commutative ring. 1850013:1-1850013:12 - Yingcai Sun, Min Chen, Dong Chen:
Acyclic 4-choosability of planar graphs without intersecting short cycles. 1850014:1-1850014:11
Volume 10, Number 2, April 2018
- Sohaib Khalid, Akbar Ali:
On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree. 1850015:1-1850015:12 - Hong-Hai Li, Yi-Ping Liang:
On the k-matchings of the complements of bicyclic graphs. 1850016:1-1850016:20 - Jun Lan, Wensong Lin:
On t-relaxed chromatic number of r-power paths. 1850017:1-1850017:9 - Yafang Hu, Weifan Wang:
2-distance vertex-distinguishing total coloring of graphs. 1850018:1-1850018:26 - Ali Zeydi Abdian, S. Morteza Mirafzal:
The spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3, 9). 1850019:1-1850019:16 - Jafar Amjadi:
The signed total Roman domatic number of a digraph. 1850020:1-1850020:9 - Zemin Jin, Kun Ye, He Chen, Yuefang Sun:
Large rainbow matchings in semi-strong edge-colorings of graphs. 1850021:1-1850021:9 - Yuehua Bu, Chentao Qi:
Injective edge coloring of sparse graphs. 1850022:1-1850022:16 - Xiaofang Jiang, Qinghui Liu, N. Parthiban, R. Sundara Rajan:
A note on minimum linear arrangement for BC graphs. 1850023:1-1850023:7 - Nuttawoot Nupo, Sayan Panma:
Independent domination number in Cayley digraphs of rectangular groups. 1850024:1-1850024:17 - Mohammad M. Karbasioun, Gennady Shaikhet, Ioannis Lambadaris, Evangelos Kranakis:
Asymptotically optimal scheduling of random malleable demands in smart grid. 1850025:1-1850025:25 - Pengcheng Liu, Xiaohui Huang:
Approximation algorithm for partial set multicover versus full set multicover. 1850026:1-1850026:9 - Zhihao Chen, Zhao Zhang:
What network topology can tell in election prediction. 1850027:1-1850027:12 - Nihal Tas, Sümeyra Uçar, Nihal Yilmaz Özgür, Öznur Öztunç Kaymak:
A new coding/decoding algorithm using Fibonacci numbers. 1850028:1-1850028:8
Volume 10, Number 3, June 2018
- Ali Jafari Taloukolaei, Shervin Sahebi:
Von Neumann regular graphs associated with rings. 1850029:1-1850029:13 - N. K. Sudev, K. P. Chithra, K. Augustine Germina, S. Satheesh, Johan Kok:
On certain coloring parameters of Mycielski graphs of some graphs. 1850030:1-1850030:21 - Supawadee Prugsapitak, Somphong Jitman:
Enumeration of self-dual cyclic codes of some specific lengths over finite fields. 1850031:1-1850031:14 - Arti Sharma, Atul Gaur:
When the maximal graph is planar, outerplanar, and ring graph. 1850032:1-1850032:8 - Amit Sharma, Rama Krishna Bandi, Maheshanand Bhaintwal:
On quantum codes via cyclic codes of arbitrary length over 픽4 + u픽4. 1850033:1-1850033:13 - Monireh Jahani Sayyad Noveiri, Sohrab Kordrostami, Alireza Amirteimoori:
Detecting the multi-period performance and efficiency changes of systems with undesirable outputs. 1850034:1-1850034:20 - Abdollah Alhevaz, Maryam Baghipur, Somnath Paul:
On the distance signless Laplacian spectral radius and the distance signless Laplacian energy of graphs. 1850035:1-1850035:19 - Anuradha Sharma, Tania Sidana:
Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2, m). 1850036:1-1850036:22 - Anwar Alwardi, Akram Alqesmah, Raghavachar Rangarajan, Ismail Naci Cangül:
Entire Zagreb indices of graphs. 1850037:1-1850037:16 - Farideh Heydari:
The M-intersection graph of ideals of a commutative ring. 1850038:1-1850038:11 - Yulong Wei, Min Xu, Kaishun Wang:
Strong rainbow connection numbers of toroidal meshes. 1850039:1-1850039:10 - Sudev Naduvath:
Equitable coloring parameters of certain graph classes. 1850040:1-1850040:12 - Fang Wang, Xiaoping Liu:
Coloring 3-power of 3-subdivision of subcubic graph. 1850041:1-1850041:9 - Marina Moscarini, Francesco M. Malvestuto:
Two classes of graphs in which some problems related to convexity are efficiently solvable. 1850042:1-1850042:22
Volume 10, Number 4, August 2018
- Terry A. McKee:
Characterizing k-chordal unichord-free graphs. 1850043:1-1850043:11 - Tao Pan, Lei Sun:
A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5. 1850044:1-1850044:14 - Hongping Ma, Xiaoxue Hu, Jiangxu Kong, Murong Xu:
Linear list r-hued coloring of sparse graphs. 1850045:1-1850045:12 - Juan Li, Jian Gao, Yongkang Wang:
Quantum codes from (1 - 2v)-constacyclic codes over the ring 픽q + u픽q + v픽q + uv픽q. 1850046:1-1850046:8 - V. Aghapouramin, Mohammad Javad Nikmehr:
Perfectness of a graph associated with annihilating ideals of a ring. 1850047:1-1850047:11 - Ismail Aydogdu, Taher Abualrub:
The structure of ℤ2ℤ2s-additive cyclic codes. 1850048:1-1850048:12 - Tapan Senapati, Young Bae Jun, Kar Ping Shum:
Cubic set structure applied in UP-algebras. 1850049:1-1850049:23 - Xiaolan Hu, Yaojun Chen:
Embedding trees in graphs with independence number two. 1850050:1-1850050:7 - M. Emami, Ozra Naserian:
New large sets of t-designs from t-homogeneous groups. 1850051:1-1850051:6 - Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Nasrin Dehgardi:
Independent Roman domination and 2-independence in trees. 1850052:1-1850052:10 - T. E. Soorya, Sunil Mathew:
Structural properties of super strongly perfect graphs. 1850053:1-1850053:11 - Toufik Mansour, Mark Shattuck:
Impulse parameter and a new equivalence between 123- and 132-avoiding permutations. 1850054:1-1850054:24 - P. Hemalatha:
Gregarious star factorization of the tensor product of graphs. 1850055:1-1850055:7 - Tushar Bag, Habibul Islam, Om Prakash, Ashish Kumar Upadhyay:
A study of constacyclic codes over the ring ℤ4[u]/〈u2 - 3〉. 1850056:1-1850056:10
Volume 10, Number 5, October 2018
- T. Tamizh Chelvam, Sekar Raja:
Integral circulant graphs with four distinct eigenvalues. 1850057:1-1850057:11 - Brahim Chaourar:
The Kth TSP is pseudopolynomial when TSP is polynomial. 1850058:1-1850058:7 - Zhenzhen Li, Baoyindureng Wu:
Maximum value of conflict-free vertex-connection number of graphs. 1850059:1-1850059:6 - Pengli Lu, Ke Gao, Yumo Wu:
Signless Laplacian spectrum of a class of generalized corona and its application. 1850060:1-1850060:12 - Gang Wang, Min-Yao Niu, Fang-Wei Fu:
Deterministic construction of compressed sensing matrices with characters over finite fields. 1850061:1-1850061:10 - T. Tamizh Chelvam, Krishnan Selvakumar, P. Subbulakshmi:
On the nil-graph of ideals of commutative Artinian rings. 1850062:1-1850062:10 - Giampiero Chiaselotti, Tommaso Gentile, Federico G. Infusino, F. Tropeano:
Rough sets on graphs: New dependency and accuracy measures. 1850063:1-1850063:27 - Qingqing Chen, Xiaohui Huang, Yingli Ran:
Approximation algorithm for distance constraint sweep coverage without predetermined base stations. 1850064:1-1850064:9 - Muhammad Imran, Abdul Qudair Baig, Muhammad Razwan Azhar:
The eccentric version of atom-bond connectivity index of tetra sheet networks. 1850065:1-1850065:16 - Cong X. Kang, Eunjeong Yi:
Bounds on the sum of domination number and metric dimension of graphs. 1850066:1-1850066:15 - Huihui Yan, Hao Qi:
3-Paintability of planar graphs. 1850067:1-1850067:20 - Yuehua Bu, Chao-Yuan Huang:
List injective coloring of a class of planar graphs without short cycles. 1850068:1-1850068:12 - Nader Jafari Rad, Elahe Sharifi:
New bounds on the independence number of connected graphs. 1850069:1-1850069:17 - Madeline Al Tahan, Bijan Davvaz:
The cyclic hypergroup associated with Sn, its automorphism group and its fuzzy grade. 1850070:1-1850070:17
Volume 10, Number 6, December 2018
- Ya-Lei Jin, Xiao-Dong Zhang:
The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs. 1850071:1-1850071:13 - Manjanna Basappa, Gautam K. Das:
Discrete unit square cover problem. 1850072:1-1850072:18 - Kardi Teknomo:
Ideal flow of Markov Chain. 1850073:1-1850073:18 - Somnath Paul:
The spectra of a new join of graphs. 1850074:1-1850074:15 - P. Roushini Leely Pushpam, Chitra Suseendran:
m-Secure vertex cover of a graph. 1850075:1-1850075:15 - Maryam Maghsoudi, Abbas Heydari:
The signless Laplacian spectrum of rooted product of graphs. 1850076:1-1850076:10 - Muhammad Imran, Abdul Qudair Baig, Shafiq Ur Rehman, Haidar Ali, Roslan Hasni:
Computing topological polynomials of mesh-derived networks. 1850077:1-1850077:25 - Min-Yao Niu, Gang Wang, You Gao, Fang-Wei Fu:
Subspace code based on flats in affine space over finite fields. 1850078:1-1850078:12 - Pani Seneviratne, Lauren Melcher:
Binary and ternary LCD codes from projective spaces. 1850079:1-1850079:8 - Mokshi Goyal, Madhu Raka:
Duadic negacyclic codes over a finite non-chain ring. 1850080:1-1850080:16 - Pinkimani Goswami, Madan Mohan Singh:
An applications of signed quadratic residues in public key cryptography. 1850081:1-1850081:14 - Somnath Paul:
Conjugate Laplacian matrices of a graph. 1850082:1-1850082:9 - Debashis Ghosh, Joydeb Pal, Lakshmi Kanta Dey:
The classification of self-orthogonal codes of length 42. 1850083:1-1850083:8 - Kyohei Nakada, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
Note on p-competition graphs of spiders. 1850084:1-1850084:7
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 2025-10-22 02:14 CEST 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:
