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”

Note on a conjecture of Marimuthu et al.

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10240363" target="_blank" >RIV/61989100:27240/18:10240363 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/18:10240363

  • Result on the web

    <a href="http://www.journalofgraphlabeling.com/current-issues/note-on-a-conjecture-of-marimuthu-et-al-72" target="_blank" >http://www.journalofgraphlabeling.com/current-issues/note-on-a-conjecture-of-marimuthu-et-al-72</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Note on a conjecture of Marimuthu et al.

  • Original language description

    For a given digraph D=(V,A) with |V|=p, |A|=q, bijection f:V+A-&gt;{1,2,.,p+q} such that f(V)={1,2,...,p} is called a V-super vertex in-antimagic total (V-SVIAMT) labeling of D if the vertex weights w(x) = f(x) +sum_{yx in A}f(yx) are all different. Marimuthu et al. conjectures in &quot;V-super vertex in-antimagic total labelings of digraphs&quot;, J. Graph Labeling, 1 (1), 2015, 21-30, that all digraphs allow a V-SVIAMT labeling. We prove their conjecture.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>ost</sub> - Miscellaneous article in a specialist periodical

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

    <a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Journal of Graph Labeling

  • ISSN

    2454-4515

  • e-ISSN

  • Volume of the periodical

    4

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    IN - INDIA

  • Number of pages

    2

  • Pages from-to

    36-37

  • UT code for WoS article

  • EID of the result in the Scopus database