Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Published November 9, 2010 | Version v1
Journal article Open

Smarandachely Roman Edge s-Dominating Function

Authors/Creators

  • Ebadi, Karam
  • Pushpalatha, I.

Description

In this paper, we find lower and upper bounds for Roman edge domination numbers in terms of the diameter and girth of G.

Files

RomanEdge.pdf

Files (180.1 kB)

Name Size Download all
RomanEdge.pdf
md5:9c1daf78fe306ee577bb159d956d8202
180.1 kB Preview Download
140
Views
136
Downloads
Show more details
All versions This version
Views

Total views

140 137
Downloads

Total downloads

136 136
Data volume

Total data volume

24.7 MB 24.7 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.9574
DOI Badge

DOI

10.5281/zenodo.9574

Markdown

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

reStructuredText

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

HTML

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

Image URL

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

Target URL

https://doi.org/10.5281/zenodo.9574
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