• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • Journal Metrics
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
  • Login
  • Register
Volume & Issue: Volume 3, Issue 1, June 2018, Pages 1-91 
Number of Articles: 6
Roman domination excellent graphs: trees

Pages 1-24

10.22049/cco.2017.25806.1041

Vladimir D. Samodivkin

  • View Article
  • PDF 616.65 K

Product version of reciprocal degree distance of composite graphs

Pages 25-35

10.22049/cco.2017.26018.1067

K Pattabiraman

  • View Article
  • PDF 478.63 K

Total $k$-Rainbow domination numbers in graphs

Pages 37-50

10.22049/cco.2018.25719.1021

Hossein Abdollahzadeh Ahangar; Jafar Amjadi; Nader Jafari Rad; Vladimir D. Samodivkin

  • View Article
  • PDF 484.44 K

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

Pages 51-70

10.22049/cco.2018.25801.1038

Behrouz Kheirfam; Masoumeh Haghighi

  • View Article
  • PDF 515.65 K

Double Roman domination and domatic numbers of graphs

Pages 71-77

10.22049/cco.2018.26125.1078

Lutz Volkmann

  • View Article
  • PDF 409.04 K

Mixed Roman domination and 2-independence in trees

Pages 79-91

10.22049/cco.2018.25964.1062

Nasrin Dehgardi

  • View Article
  • PDF 426.14 K

Communications in Combinatorics and Optimization
  • Articles in Press
  • Current Issue

Journal Archive

Volume 8 (2023)
Volume 7 (2022)
Volume 6 (2021)
Volume 5 (2020)
Volume 4 (2019)
Volume 3 (2018)
Issue 2
Issue 1
Volume 2 (2017)
Volume 1 (2016)

Explore Journal

  • Home
  • About Journal
  • Editorial Board
  • Submit Manuscript
  • Contact Us
  • Glossary
  • Hard Copy Subscription
  • Sitemap

Latest News

  • We are delighted to announce that Communications in Combinatorics and Optimization is indexed as Web of Knowledge from 2020. 2022-07-27
  • Since 1400 (Iranian calendar) -2021, Communications in Combinatorics and Optimization is indexed by the MSRT as as an International scientific and research journal. 2021-11-01
  • indexed by Scopus 2020-10-01
  • Including the journal Communications in Combinatorics and Optimization as a listing in MathSciNet 2017-05-28

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

Newsletter Subscription

Subscribe to the journal newsletter and receive the latest news and updates

  • © Journal Management System. Powered by Sinaweb