All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

15 676 (0,115s)

Result

Note on enumeration of labeled split graphs

Main topics of the document: graph enumeration; labeled graph; split graph...

BA - Obecná matematika

  • 2015
  • Jx
  • Link
Result

Optimal real number graph labelings of a subfamily of Kneser graphs

We construct optimal real number graph labelings for some Kneser graphs.

BA - Obecná matematika

  • 2009
  • Jx
Result

Antimagic Labeling of Generalized Pyramid Graphs

An antimagic labeling of a graph with q edges is a bijection from the set are pairwise distinct, where the vertex weight of a vertex is the sum of the labels of all edges incident with that vertex. A graph is antim...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
Result

Antimagicness of some families of generalized graphs

An edge labelling of a graph G=(V,E) is a bijection from the set of edges to the set of integers {1,2,...,|E|}. The weight of a vertex v is the sum of the labels that the labelling is vertex-antimagic. A graph<...

BA - Obecná matematika

  • 2012
  • Jx
Result

Distance constrained labelings of graphs of bounded treewidth

The paper considers distance constrained labelings of graphs of bounded treewidth. In particular we prove that L(2,1) labeling is NP-hard for series-parallel graphs, i.e., graphs of treewidth two....

BA - Obecná matematika

  • 2005
  • D
Result

Super d-antimagic labeling of disconnected plane graphs

This paper deals with the problem of labeling the vertices, edges and faces of a plane graph in such a way that the label of a face and the labels of the vertices that appears in the graph. The paper exami...

BA - Obecná matematika

  • 2010
  • Jx
Result

Characterisation of graphs with exclusive sum labelling

if the sum of their labels is an element of S. In an exclusive sum graph the integers of S that are the sum of two other integers of S form a set of integers that label, we provide a characterisation of graphs tha...

Pure mathematics

  • 2017
  • JSC
  • Link
Result

On super (a,d)-edge-antimagic total labeling of disconnected graphs

This paper gives new edge-antimagic total labelling for various families of disconnected graphs that are copies of isomorphic graphs....

BA - Obecná matematika

  • 2009
  • Jx
Result

Difference distance magic oriented graphs

This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DD...

Applied mathematics

  • 2024
  • Jimp
  • Link
Result

Antimagicness of generalised corona and snowflake graphs

This paper provides constructions of antimagic labelings of two families of graphs, namely, sequential generalized corona graphs and generalized snowflake graphs. The labelings can also be used for some fa...

BA - Obecná matematika

  • 2015
  • Jx
  • Link
  • 1 - 10 out of 15 676