• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Advisory Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • Export Citation Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
Communications in Combinatorics and Optimization
Articles in Press
Current Issue
Journal Archive
Volume Volume 3 (2018)
Volume Volume 2 (2017)
Volume Volume 1 (2016)
Issue Issue 2
Issue Issue 1
Volkmann, L. (2016). Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs. Communications in Combinatorics and Optimization, 1(1), 1-13. doi: 10.22049/cco.2016.13514
L. Volkmann. "Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs". Communications in Combinatorics and Optimization, 1, 1, 2016, 1-13. doi: 10.22049/cco.2016.13514
Volkmann, L. (2016). 'Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs', Communications in Combinatorics and Optimization, 1(1), pp. 1-13. doi: 10.22049/cco.2016.13514
Volkmann, L. Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs. Communications in Combinatorics and Optimization, 2016; 1(1): 1-13. doi: 10.22049/cco.2016.13514

Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs

Article 1, Volume 1, Issue 1, Winter and Spring 2016, Page 1-13  XML PDF (402 K)
Document Type: Original paper
DOI: 10.22049/cco.2016.13514
Author
L. Volkmann
RWTH Aachen University
Abstract
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient conditions for digraphs to be maximally edge-connected in terms of the zeroth-order general Randic index, the order and the minimum degree when  Using the associated digraph of a graph, we show that our results include some corresponding known results on graphs.
Keywords
Digraphs; Edge-connectivity; Maximally edge-connected digraphs; Zeroth-order general Randic index
Main Subjects
Graph theory
Statistics
Article View: 1,235
PDF Download: 1,691
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Journal Management System. Designed by sinaweb.