X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
matemàtiques i estadística (74) 74
àrees temàtiques de la upc (74) 74
graph theory (72) 72
05c graph theory (70) 70
grafs, teoria de (68) 68
classificació ams (67) 67
05 combinatorics (66) 66
05 combinatorics::05c graph theory [classificació ams] (66) 66
mathematics (61) 61
matemàtica discreta (56) 56
teoria de grafs (47) 47
matemàtiques i estadística::matemàtica discreta::teoria de grafs [àrees temàtiques de la upc] (34) 34
mathematics, applied (26) 26
combinatòria (23) 23
graphs (22) 22
mathematics - combinatorics (21) 21
combinatorial analysis (19) 19
matemàtiques i estadística::matemàtica discreta::combinatòria [àrees temàtiques de la upc] (19) 19
combinatorics (18) 18
computer science (15) 15
05c (13) 13
discrete mathematics and combinatorics (13) 13
discrete mathematics (11) 11
eigenvalues (11) 11
matemàtiques i estadística [àrees temàtiques de la upc] (11) 11
spectrum (11) 11
algorithms (10) 10
investigació operativa (10) 10
05e algebraic combinatorics (9) 9
theoretical computer science (9) 9
adjacency matrix (8) 8
graph (8) 8
mathematical models (8) 8
polynomials (8) 8
combinacions (7) 7
computer science, theory & methods (7) 7
diameter (7) 7
distance-regular graph (7) 7
05 combinatorics::05e algebraic combinatorics [classificació ams] (6) 6
90 operations research, mathematical programming (6) 6
analysis (6) 6
mathematics, general (6) 6
networks (6) 6
teoria de jocs (6) 6
trees (6) 6
90b operations research and management science (5) 5
91 game theory, economics, social and behavioral sciences (5) 5
94 information and communication, circuits (5) 5
94 information and communication, circuits::94c circuits, networks [classificació ams] (5) 5
94c circuits, networks (5) 5
clutter (5) 5
computation (5) 5
matemàtiques i estadística::investigació operativa::teoria de jocs [àrees temàtiques de la upc] (5) 5
models matemàtics (5) 5
operations research & management science (5) 5
05c teoria de grafs (4) 4
11 number theory (4) 4
60 probability theory and stochastic processes (4) 4
68 computer science (4) 4
90 operations research, mathematical programming::90b operations research and management science [classificació ams] (4) 4
abstencionisme electoral (4) 4
abstention (4) 4
algebra and number theory (4) 4
apexes (4) 4
complex networks (4) 4
decomposition (4) 4
digraph (4) 4
games (4) 4
girth (4) 4
hypergraph (4) 4
matemàtiques i estadística::probabilitat [àrees temàtiques de la upc] (4) 4
mathematics, interdisciplinary applications (4) 4
matroid (4) 4
models (4) 4
planar graphs (4) 4
power (4) 4
probabilitat (4) 4
statistics & probability (4) 4
tree (4) 4
vot (4) 4
vot -- models matemàtics (4) 4
voting (4) 4
voting--mathematical models (4) 4
05b designs and configurations (3) 3
91 game theory, economics, social and behavioral sciences::91a game theory [classificació ams] (3) 3
91a game theory (3) 3
[ math.math-co ] mathematics [math]/combinatorics [math.co] (3) 3
ams subject classification classes: 05c (3) 3
applied mathematics (3) 3
approval (3) 3
cayley digraph (3) 3
computational mathematics and numerical analysis (3) 3
cycles (3) 3
decision making (3) 3
decision making--mathematical models (3) 3
decisió, presa de (3) 3
decisió, presa de -- models matemàtics (3) 3
degree/diameter problem (3) 3
domination (3) 3
game theory (3) 3
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Applicable Analysis and Discrete Mathematics, ISSN 1452-8630, 4/2018, Volume 12, Issue 1, pp. 205 - 223
Journal Article
Designs, Codes, and Cryptography, ISSN 0925-1022, 07/2017, Volume 84, Issue 1-2, pp. 55 - 71
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2019, Volume 266, pp. 237 - 251
A partition Π={S1,…,Sk} of the vertex set of a connected graph G is called a resolving partition of G if for every pair of vertices u and v, d(u,Sj)≠d(v,Sj),... 
Dominating partition dimension | Resolving domination | Resolving partition | Partition dimension | Resolving dominating partition | Metric location | METRIC DIMENSION | MATHEMATICS, APPLIED | BOUNDS | SETS | Apexes | Graphs | Partitions | 05 Combinatorics | 05C Graph theory | Graph theory | Classificació AMS | Grafs, Teoria de | Matemàtiques i estadística | Àrees temàtiques de la UPC
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 07/2018, Volume 68, pp. 185 - 190
Journal Article
Discrete Mathematics, ISSN 0012-365X, 10/2019, Volume 342, Issue 10, pp. 2875 - 2885
Journal Article
International Journal of Foundations of Computer Science, ISSN 0129-0541, 06/2018, Volume 29, Issue 4, pp. 551 - 569
We consider an online model where an adversary constructs a set of 2s instancus s instead of one single instance. The algorithm knows S and the adversary will... 
graph coloring | information | randomization | Online computation | ADVICE COMPLEXITY | ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | BIPARTITE GRAPHS
Journal Article
Journal Article
Linear Algebra and Its Applications, ISSN 0024-3795, 01/2016, Volume 488, pp. 363 - 376
Journal Article
Linear Algebra and Its Applications, ISSN 0024-3795, 06/2019, Volume 570, pp. 138 - 147
A (1,≤ℓ)-identifying code in digraph D is a dominating subset C of vertices of D, such that all distinct subsets of vertices of D with cardinality at most ℓ... 
Adjacency matrix | Eigenvectors | Graph | Digraph | Identifying code | Spectrum | MATHEMATICS | MATHEMATICS, APPLIED | Apexes | Upper bounds | Graph theory | 05 Combinatorics | 05C Graph theory | Matemàtica discreta | identifying code | Classificació AMS | adjacency matrix | Grafs, Teoria de | digraph | spectrum | eigenvectors | Teoria de grafs | Matemàtiques i estadística | Àrees temàtiques de la UPC
Journal Article
Journal of Combinatorial Theory, Series A, ISSN 0097-3165, 02/2018, Volume 154, pp. 406 - 421
An old conjecture of Ringel states that every tree with m edges decomposes the complete graph K2m+1. The best known lower bound for the order of a complete... 
Graph decomposition | Ringel's conjecture | Polynomial method | MATHEMATICS | PACKING | FAMILIES | Grafs, Teoria de | 05 Combinatorics | Teoria de grafs | 05C Graph theory | Matemàtiques i estadística | Matemàtica discreta | Graph theory | Classificació AMS | Àrees temàtiques de la UPC
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 06/2019, Volume 263, pp. 195 - 203
A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of... 
Domination | Bipartite graph | Distinguishing set | Locating domination | Complement graph | Location | MATHEMATICS, APPLIED | SETS | IDENTIFYING CODES | Graphs | Codes | Graph theory | Apexes | Grafs, Teoria de | Matemàtiques i estadística | Àrees temàtiques de la UPC
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 10/2016, Volume 54, pp. 193 - 198
A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdős and Spencer on the... 
Rainbow matchings | Lovász Local lemma | 05 Combinatorics | Combinacions (Matemàtica) | 05C Graph theory | Matemàtica discreta | Graph theory | Classificació AMS | Combinatòria | Grafs, Teoria de | Teoria de grafs | Matemàtiques i estadística | 05E Algebraic combinatorics | Combinatorial analysis | Àrees temàtiques de la UPC
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 9/2018, Volume 34, Issue 5, pp. 947 - 964
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2015, Volume 49, pp. 457 - 463
Let Γ be a distance-regular graph with diameter d and Kneser graph K=Γd, the distance-d graph of Γ. We say that Γ is partially antipodal when K has fewer... 
Distance-regular graph | Partial antipodality | Predistance polynomials | Kneser graph | Spectrum | 05 Combinatorics | 05C Graph theory | Matemàtica discreta | Graph theory | Classificació AMS | Combinatòria | Teoria de grafs | Matemàtiques i estadística | Combinatorial analysis | Àrees temàtiques de la UPC
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 8, pp. 2613 - 2614
This note deals with the relationship between the total number of k -walks in a graph, and the sum of the k -th powers of its vertex degrees. In particular, it... 
Adjacency matrix | Laplacian matrix | Graph | Walks | Degree powers | MATHEMATICS | SUM | SQUARES
Journal Article
International Journal for Numerical Methods in Engineering, ISSN 0029-5981, 11/2013, Volume 96, Issue 9, pp. 529 - 560
Journal Article
Combinatorics Probability and Computing, ISSN 0963-5483, 09/2014, Volume 760, Issue 1, pp. 145 - 178
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 08/2017, Volume 61, pp. 933 - 939
In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition.... 
generating functions | planar graphs | graph enumeration | 05 Combinatorics | 05C Graph theory | Matemàtiques i estadística | Classificació AMS | Àrees temàtiques de la UPC
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.