default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 203
Volume 203, April 2016
- Martin Anthony
, Endre Boros, Yves Crama, Aritanan Gruber:
Quadratization of symmetric pseudo-Boolean functions. 1-12
- Liliana Alcón, Marisa Gutierrez, István Kovács, Martin Milanic, Romeo Rizzi:
Strong cliques and equistability of EPT graphs. 13-25 - Marianna Bolla:
Relating multiway discrepancy and singular values of nonnegative rectangular matrices. 26-34 - Yair Caro, Adriana Hansberg, Ryan Pepper:
Regular independent sets. 35-46 - Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
Richardson's Theorem for k-colored kernels in strongly connected digraphs. 47-52 - Severino Villanueva Gervacio:
Resistance distance in complete n-partite graphs. 53-61 - Alain Hertz, Hadrien Mélot:
Counting the number of non-equivalent vertex colorings of a graph. 62-71 - Pranava K. Jha:
A family of efficient six-regular circulants representable as a Kronecker product. 72-84 - Vadim E. Levit, Eugen Mandrescu:
On the independence polynomial of the corona of graphs. 85-93 - Faxu Li, Liang Wei, Haixing Zhao, Feng Hu, Xiujuan Ma:
On the Estrada index of cactus graphs. 94-105 - Wenshui Lin, Yuan Zhang, Qi'an Chen, Jiwen Chen, Chi Ma, Junjie Chen:
Ordering trees by their distance spectral radii. 106-110 - Xianliang Liu, Zishen Yang, Wei Wang:
Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs. 111-116 - Dmitriy S. Malyshev:
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs. 117-126 - Santanu Sarkar:
Revisiting Prime Power RSA. 127-133 - Yunfang Tang, Douglas B. West, Bo Zhou:
Extremal problems for degree-based topological indices. 134-143 - Xi Wang, Jianxi Fan, Jingya Zhou, Cheng-Kuan Lin:
The restricted h-connectivity of the data center network DCell. 144-157 - Tingzeng Wu, Heping Zhang:
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges. 158-170 - Kexiang Xu, Kinkar Chandra Das:
Some extremal graphs with respect to inverse degree. 171-183 - Yu Yang, Hongbo Liu, Hua Wang, Shigang Feng:
On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs. 184-203 - Manouchehr Zaker:
Lower bounds for the independence and k-independence number of graphs using the concept of degenerate degrees. 204-216
- Jia-Bao Liu, Wen-Rui Wang, Yong-Ming Zhang, Xiang-Feng Pan:
On degree resistance distance of cacti. 217-225
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-11-06 20:35 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:
