Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Published May 1, 2011 | Version v1
Journal article Open

Supermagic Coverings of Some Simple Graphs

Authors/Creators

  • Jeyanthi, P.
  • Selvagopal, P.

Description

Showing that edge amalgamation of a finite collection of graphs isomorphic to any 2-connected simple graph H is H-supermagic.

Files

SupermagicCoverings.pdf

Files (373.7 kB)

Name Size
SupermagicCoverings.pdf
md5:585a82bb259000ea79aa3d3d9b8c9c7c
373.7 kB Preview Download
164
Views
110
Downloads
Show more details
All versions This version
Views

Total views

164 163
Downloads

Total downloads

110 110
Data volume

Total data volume

41.1 MB 41.1 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.9229
DOI Badge

DOI

10.5281/zenodo.9229

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.9229.svg)](https://doi.org/10.5281/zenodo.9229)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.9229.svg
  :target: https://doi.org/10.5281/zenodo.9229

HTML

<a href="https://doi.org/10.5281/zenodo.9229"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.9229.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.9229.svg

Target URL

https://doi.org/10.5281/zenodo.9229
Resource type
Journal article
Publisher
Zenodo

Rights

License
cc-by-4.0 icon Creative Commons Attribution 4.0 International
The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Citation

Export

Technical metadata

Created
May 5, 2014
Modified
August 6, 2024

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Support

  • Help
  • FAQ

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use

This site uses cookies. Find out more on how we use cookies