nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A characterization of balanced Boolean functions with optimal algebraic immunity
|
Xie, Tao |
|
|
247 |
C |
p. 186-196 |
artikel |
2 |
Applications of max-plus algebra to flow shop scheduling problems
|
Kubo, Susumu |
|
|
247 |
C |
p. 278-293 |
artikel |
3 |
Cactus graphs with minimum edge revised Szeged index
|
Liu, Mengmeng |
|
|
247 |
C |
p. 90-96 |
artikel |
4 |
Conditional diagnosability of multiprocessor systems based on complete-transposition graphs
|
Xu, Liqiong |
|
|
247 |
C |
p. 367-379 |
artikel |
5 |
Conditional edge-fault-tolerant Hamiltonicity of the data center network
|
Qin, Xiao-Wen |
|
|
247 |
C |
p. 165-179 |
artikel |
6 |
Connected graph G with σ 2 ( G ) ≥ 2 3 n and K 1 , 4 -free contains a Hamiltonian path
|
Momège, Benjamin |
|
|
247 |
C |
p. 37-42 |
artikel |
7 |
Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
|
Chen, Shuya |
|
|
247 |
C |
p. 135-146 |
artikel |
8 |
Critical and maximum independent sets of a graph
|
Jarden, Adi |
|
|
247 |
C |
p. 127-134 |
artikel |
9 |
Editorial Board
|
|
|
|
247 |
C |
p. ii |
artikel |
10 |
Enumerating graphs via even/odd dichotomy
|
Hujdurović, Ademir |
|
|
247 |
C |
p. 252-262 |
artikel |
11 |
Extending single tolerances to set tolerances
|
Jäger, Gerold |
|
|
247 |
C |
p. 197-215 |
artikel |
12 |
Facial L ( 2 , 1 ) -edge-labelings of trees
|
Czap, Július |
|
|
247 |
C |
p. 357-366 |
artikel |
13 |
Fast algorithms for indices of nested split graphs approximating real complex networks
|
Sciriha, Irene |
|
|
247 |
C |
p. 152-164 |
artikel |
14 |
Gender consistent resolving rules in marriage problems
|
Dimitrov, Dinko |
|
|
247 |
C |
p. 147-151 |
artikel |
15 |
General multiplicative Zagreb indices of trees
|
Vetrík, Tomáš |
|
|
247 |
C |
p. 341-351 |
artikel |
16 |
Homothetic polygons and beyond: Maximal cliques in intersection graphs
|
Brimkov, Valentin E. |
|
|
247 |
C |
p. 263-277 |
artikel |
17 |
k -planar crossing number of random graphs and random regular graphs
|
Asplund, John |
|
|
247 |
C |
p. 419-422 |
artikel |
18 |
Matchings in graphs and groups
|
Jarden, Adi |
|
|
247 |
C |
p. 216-224 |
artikel |
19 |
Minimum multiplicity edge coloring via orientation
|
Bampas, Evangelos |
|
|
247 |
C |
p. 380-388 |
artikel |
20 |
Modulo orientations with bounded independence number
|
Han, Miaomiao |
|
|
247 |
C |
p. 14-22 |
artikel |
21 |
Multiplicity of eigenvalues of cographs
|
Allem, Luiz Emilio |
|
|
247 |
C |
p. 43-52 |
artikel |
22 |
On comparing algorithms for the maximum clique problem
|
Züge, Alexandre Prusch |
|
|
247 |
C |
p. 1-13 |
artikel |
23 |
On optimal piercing of a square
|
Bašić, Bojan |
|
|
247 |
C |
p. 242-251 |
artikel |
24 |
On regular and new types of codes for location-domination
|
Junnila, Ville |
|
|
247 |
C |
p. 225-241 |
artikel |
25 |
On some open problems concerning quorum colorings of graphs
|
Sahbi, Rafik |
|
|
247 |
C |
p. 294-299 |
artikel |
26 |
On the difference between the (revised) Szeged index and the Wiener index of cacti
|
Klavžar, Sandi |
|
|
247 |
C |
p. 77-89 |
artikel |
27 |
On the number of maximal independent sets in minimum colorings of split graphs
|
Brešar, Boštjan |
|
|
247 |
C |
p. 352-356 |
artikel |
28 |
On the precise value of the strong chromatic index of a planar graph with a large girth
|
Chang, Gerard Jennhwa |
|
|
247 |
C |
p. 389-397 |
artikel |
29 |
On the von Neumann entropy of a graph
|
Lin, Hongying |
|
|
247 |
C |
p. 448-455 |
artikel |
30 |
Optimal FHSs and DSSs via near zero-difference balanced functions
|
Xu, Shanding |
|
|
247 |
C |
p. 433-447 |
artikel |
31 |
Optimal odd gossiping
|
Fertin, Guillaume |
|
|
247 |
C |
p. 53-69 |
artikel |
32 |
Rainbow spanning trees in properly coloured complete graphs
|
Balogh, József |
|
|
247 |
C |
p. 97-101 |
artikel |
33 |
Safe number and integrity of graphs
|
Fujita, Shinya |
|
|
247 |
C |
p. 398-406 |
artikel |
34 |
Secure domination in proper interval graphs
|
Araki, Toru |
|
|
247 |
C |
p. 70-76 |
artikel |
35 |
Sharp bounds for the Randić index of graphs with given minimum and maximum degree
|
O, Suil |
|
|
247 |
C |
p. 111-115 |
artikel |
36 |
Some spectral invariants of the neighborhood corona of graphs
|
Yang, Yujun |
|
|
247 |
C |
p. 300-308 |
artikel |
37 |
Strict chordal digraphs viewed as graphs with distinguished edges
|
McKee, Terry A. |
|
|
247 |
C |
p. 122-126 |
artikel |
38 |
Structural properties of resonance graphs of plane elementary bipartite graphs
|
Che, Zhongyuan |
|
|
247 |
C |
p. 102-110 |
artikel |
39 |
The crossing number of locally twisted cubes L T Q n
|
Lingqi, Zhao |
|
|
247 |
C |
p. 407-418 |
artikel |
40 |
The diameter of strong orientations of Cartesian products of graphs
|
Špacapan, Simon |
|
|
247 |
C |
p. 116-121 |
artikel |
41 |
The packing number of the double vertex graph of the path graph
|
Gómez Soto, J.M. |
|
|
247 |
C |
p. 327-340 |
artikel |
42 |
The robot crawler graph process
|
Bonato, Anthony |
|
|
247 |
C |
p. 23-36 |
artikel |
43 |
The weighted coloring problem for two graph classes characterized by small forbidden induced structures
|
Malyshev, D.S. |
|
|
247 |
C |
p. 423-432 |
artikel |
44 |
The weighted vertex PI index of bicyclic graphs
|
Ma, Gang |
|
|
247 |
C |
p. 309-321 |
artikel |
45 |
Two results about the hypercube
|
Balogh, József |
|
|
247 |
C |
p. 322-326 |
artikel |
46 |
Wiener index and Harary index on Hamilton-connected graphs with large minimum degree
|
Zhou, Qiannan |
|
|
247 |
C |
p. 180-185 |
artikel |