Results 71 to 80 of about 140,706 (235)
Shotgun Assembly of Labeled Graphs
IEEE Transactions on Network Science and Engineering, 2019 Ver3: 23 pages, matches published version but with a corrected proof of Theorem 4.5 (result unchanged); Ver2: 22 pages; Ver1: 21 ...
Mossel, E, Ross, N
openaire +3 more sources
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r)
E-Jurnal Matematika, 2017 Graph labelling is a function that maps graph elements to positive integers. A covering of graph is family subgraph from , for with integer k. Graph admits covering if for every subgraph is isomorphic to a graph .
TIRA CATUR ROSALIA +2 more
doaj +1 more source
Predicting the labelling of a graph via minimum p-seminorm interpolation [PDF]
, 2009 We study the problem of predicting the labelling of a graph. The graph is given and a trial sequence of (vertex,label) pairs is then incrementally revealed to the learner. On each trial a vertex is queried and the learner predicts a boolean label.
Herbster, M, Lever, G
core +3 more sources
Labeling angles of planar graphs
Discrete Mathematics, 1988 By a well-known theorem of Heawood, 3-edge-coloring bridgeless planar cubic graphs is equivalent to labeling vertices with \(+1\) or -1 so that the sum around any face is 0(mod 3). The authors introduce the notion of ``angle-labeling'' and prove results analogous to Heawood's for bridgeless planar graphs with vertices of degree 2 or 3; the angles and ...
Loupekine, Feodor, Watkins, John J.
openaire +1 more source
Skolem Number of Kagome Lattice Graphs
Theory and Applications of GraphsA proper Skolem labelling of a graph $G$ is a function assigning a positive integer to each vertex of $G$ such that any two vertices assigned the same integer are that distance apart in the graph.
Braxton Carrigan, Max Martone
doaj +1 more source
Constant 2-Labellings And An Application To (R, A, B)-Covering Codes
Discussiones Mathematicae Graph Theory, 2017 We introduce the concept of constant 2-labelling of a vertex-weighted graph and show how it can be used to obtain perfect weighted coverings. Roughly speaking, a constant 2-labelling of a vertex-weighted graph is a black and white colouring of its vertex
Gravier Sylvain, Vandomme Èlise
doaj +1 more source
Largest cliques in connected supermagic graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A graph $G=(V,E)$ is said to be $\textit{magic}$ if there exists an integer labeling $f: V \cup E \to [1, |V \cup E|]$ such that $f(x)+f(y)+f(xy)$ is constant for all edges $xy \in E$.
Anna Lladó
doaj +1 more source
Opuscula Mathematica, 2009 We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\). This notion generalizes the \(\alpha\)-labeling introduced in 1967 by A. Rosa.
openaire +1 more source
Enumeration of labelled chain graphs and labelled essential directed acyclic graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Rule-based transformations for geometric modelling [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The context of this paper is the use of formal methods for topology-based geometric modelling. Topology-based geometric modelling deals with objects of various dimensions and shapes.
Thomas Bellet +2 more
doaj +1 more source