for Journals by Title or ISSN
for Articles by Keywords
help

Publisher: Elsevier   (Total: 3043 journals)

 A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Showing 1 - 200 of 3043 Journals sorted alphabetically
AASRI Procedia     Open Access   (Followers: 15)
Academic Pediatrics     Hybrid Journal   (Followers: 22, SJR: 1.402, h-index: 51)
Academic Radiology     Hybrid Journal   (Followers: 21, SJR: 1.008, h-index: 75)
Accident Analysis & Prevention     Partially Free   (Followers: 84, SJR: 1.109, h-index: 94)
Accounting Forum     Hybrid Journal   (Followers: 25, SJR: 0.612, h-index: 27)
Accounting, Organizations and Society     Hybrid Journal   (Followers: 30, SJR: 2.515, h-index: 90)
Achievements in the Life Sciences     Open Access   (Followers: 4)
Acta Anaesthesiologica Taiwanica     Open Access   (Followers: 5, SJR: 0.338, h-index: 19)
Acta Astronautica     Hybrid Journal   (Followers: 350, SJR: 0.726, h-index: 43)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 3)
Acta Biomaterialia     Hybrid Journal   (Followers: 25, SJR: 2.02, h-index: 104)
Acta Colombiana de Cuidado Intensivo     Full-text available via subscription   (Followers: 1)
Acta de Investigación Psicológica     Open Access   (Followers: 2)
Acta Ecologica Sinica     Open Access   (Followers: 8, SJR: 0.172, h-index: 29)
Acta Haematologica Polonica     Free   (SJR: 0.123, h-index: 8)
Acta Histochemica     Hybrid Journal   (Followers: 3, SJR: 0.604, h-index: 38)
Acta Materialia     Hybrid Journal   (Followers: 240, SJR: 3.683, h-index: 202)
Acta Mathematica Scientia     Full-text available via subscription   (Followers: 5, SJR: 0.615, h-index: 21)
Acta Mechanica Solida Sinica     Full-text available via subscription   (Followers: 9, SJR: 0.442, h-index: 21)
Acta Oecologica     Hybrid Journal   (Followers: 10, SJR: 0.915, h-index: 53)
Acta Otorrinolaringologica (English Edition)     Full-text available via subscription   (Followers: 1)
Acta Otorrinolaringológica Española     Full-text available via subscription   (Followers: 3, SJR: 0.311, h-index: 16)
Acta Pharmaceutica Sinica B     Open Access   (Followers: 2)
Acta Poética     Open Access   (Followers: 4)
Acta Psychologica     Hybrid Journal   (Followers: 23, SJR: 1.365, h-index: 73)
Acta Sociológica     Open Access  
Acta Tropica     Hybrid Journal   (Followers: 6, SJR: 1.059, h-index: 77)
Acta Urológica Portuguesa     Open Access  
Actas Dermo-Sifiliograficas     Full-text available via subscription   (Followers: 4)
Actas Dermo-Sifiliográficas (English Edition)     Full-text available via subscription   (Followers: 3)
Actas Urológicas Españolas     Full-text available via subscription   (Followers: 4, SJR: 0.383, h-index: 19)
Actas Urológicas Españolas (English Edition)     Full-text available via subscription   (Followers: 2)
Actualites Pharmaceutiques     Full-text available via subscription   (Followers: 5, SJR: 0.141, h-index: 3)
Actualites Pharmaceutiques Hospitalieres     Full-text available via subscription   (Followers: 4, SJR: 0.112, h-index: 2)
Acupuncture and Related Therapies     Hybrid Journal   (Followers: 4)
Acute Pain     Full-text available via subscription   (Followers: 13)
Ad Hoc Networks     Hybrid Journal   (Followers: 11, SJR: 0.967, h-index: 57)
Addictive Behaviors     Hybrid Journal   (Followers: 15, SJR: 1.514, h-index: 92)
Addictive Behaviors Reports     Open Access   (Followers: 5)
Additive Manufacturing     Hybrid Journal   (Followers: 7, SJR: 1.039, h-index: 5)
Additives for Polymers     Full-text available via subscription   (Followers: 21)
Advanced Drug Delivery Reviews     Hybrid Journal   (Followers: 135, SJR: 5.2, h-index: 222)
Advanced Engineering Informatics     Hybrid Journal   (Followers: 11, SJR: 1.265, h-index: 53)
Advanced Powder Technology     Hybrid Journal   (Followers: 17, SJR: 0.739, h-index: 33)
Advances in Accounting     Hybrid Journal   (Followers: 9, SJR: 0.299, h-index: 15)
Advances in Agronomy     Full-text available via subscription   (Followers: 15, SJR: 2.071, h-index: 82)
Advances in Anesthesia     Full-text available via subscription   (Followers: 25, SJR: 0.169, h-index: 4)
Advances in Antiviral Drug Design     Full-text available via subscription   (Followers: 3)
Advances in Applied Mathematics     Full-text available via subscription   (Followers: 6, SJR: 1.054, h-index: 35)
Advances in Applied Mechanics     Full-text available via subscription   (Followers: 11, SJR: 0.801, h-index: 26)
Advances in Applied Microbiology     Full-text available via subscription   (Followers: 22, SJR: 1.286, h-index: 49)
Advances In Atomic, Molecular, and Optical Physics     Full-text available via subscription   (Followers: 16, SJR: 3.31, h-index: 42)
Advances in Biological Regulation     Hybrid Journal   (Followers: 4, SJR: 2.277, h-index: 43)
Advances in Botanical Research     Full-text available via subscription   (Followers: 3, SJR: 0.619, h-index: 48)
Advances in Cancer Research     Full-text available via subscription   (Followers: 25, SJR: 2.215, h-index: 78)
Advances in Carbohydrate Chemistry and Biochemistry     Full-text available via subscription   (Followers: 9, SJR: 0.9, h-index: 30)
Advances in Catalysis     Full-text available via subscription   (Followers: 5, SJR: 2.139, h-index: 42)
Advances in Cellular and Molecular Biology of Membranes and Organelles     Full-text available via subscription   (Followers: 12)
Advances in Chemical Engineering     Full-text available via subscription   (Followers: 26, SJR: 0.183, h-index: 23)
Advances in Child Development and Behavior     Full-text available via subscription   (Followers: 10, SJR: 0.665, h-index: 29)
Advances in Chronic Kidney Disease     Full-text available via subscription   (Followers: 9, SJR: 1.268, h-index: 45)
Advances in Clinical Chemistry     Full-text available via subscription   (Followers: 29, SJR: 0.938, h-index: 33)
Advances in Colloid and Interface Science     Full-text available via subscription   (Followers: 18, SJR: 2.314, h-index: 130)
Advances in Computers     Full-text available via subscription   (Followers: 16, SJR: 0.223, h-index: 22)
Advances in Dermatology     Full-text available via subscription   (Followers: 12)
Advances in Developmental Biology     Full-text available via subscription   (Followers: 11)
Advances in Digestive Medicine     Open Access   (Followers: 6)
Advances in DNA Sequence-Specific Agents     Full-text available via subscription   (Followers: 5)
Advances in Drug Research     Full-text available via subscription   (Followers: 22)
Advances in Ecological Research     Full-text available via subscription   (Followers: 41, SJR: 3.25, h-index: 43)
Advances in Engineering Software     Hybrid Journal   (Followers: 25, SJR: 0.486, h-index: 10)
Advances in Experimental Biology     Full-text available via subscription   (Followers: 7)
Advances in Experimental Social Psychology     Full-text available via subscription   (Followers: 41, SJR: 5.465, h-index: 64)
Advances in Exploration Geophysics     Full-text available via subscription   (Followers: 3)
Advances in Food and Nutrition Research     Full-text available via subscription   (Followers: 50, SJR: 0.674, h-index: 38)
Advances in Fuel Cells     Full-text available via subscription   (Followers: 16)
Advances in Genetics     Full-text available via subscription   (Followers: 15, SJR: 2.558, h-index: 54)
Advances in Genome Biology     Full-text available via subscription   (Followers: 11)
Advances in Geophysics     Full-text available via subscription   (Followers: 6, SJR: 2.325, h-index: 20)
Advances in Heat Transfer     Full-text available via subscription   (Followers: 22, SJR: 0.906, h-index: 24)
Advances in Heterocyclic Chemistry     Full-text available via subscription   (Followers: 9, SJR: 0.497, h-index: 31)
Advances in Imaging and Electron Physics     Full-text available via subscription   (Followers: 2, SJR: 0.396, h-index: 27)
Advances in Immunology     Full-text available via subscription   (Followers: 35, SJR: 4.152, h-index: 85)
Advances in Inorganic Chemistry     Full-text available via subscription   (Followers: 9, SJR: 1.132, h-index: 42)
Advances in Insect Physiology     Full-text available via subscription   (Followers: 3, SJR: 1.274, h-index: 27)
Advances in Integrative Medicine     Hybrid Journal   (Followers: 6)
Advances in Life Course Research     Hybrid Journal   (Followers: 8, SJR: 0.764, h-index: 15)
Advances in Lipobiology     Full-text available via subscription   (Followers: 2)
Advances in Magnetic and Optical Resonance     Full-text available via subscription   (Followers: 9)
Advances in Marine Biology     Full-text available via subscription   (Followers: 16, SJR: 1.645, h-index: 45)
Advances in Mathematics     Full-text available via subscription   (Followers: 10, SJR: 3.261, h-index: 65)
Advances in Medical Sciences     Hybrid Journal   (Followers: 6, SJR: 0.489, h-index: 25)
Advances in Medicinal Chemistry     Full-text available via subscription   (Followers: 5)
Advances in Microbial Physiology     Full-text available via subscription   (Followers: 4, SJR: 1.44, h-index: 51)
Advances in Molecular and Cell Biology     Full-text available via subscription   (Followers: 22)
Advances in Molecular and Cellular Endocrinology     Full-text available via subscription   (Followers: 10)
Advances in Molecular Toxicology     Full-text available via subscription   (Followers: 7, SJR: 0.324, h-index: 8)
Advances in Nanoporous Materials     Full-text available via subscription   (Followers: 4)
Advances in Oncobiology     Full-text available via subscription   (Followers: 3)
Advances in Organometallic Chemistry     Full-text available via subscription   (Followers: 15, SJR: 2.885, h-index: 45)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7, SJR: 0.148, h-index: 11)
Advances in Parasitology     Full-text available via subscription   (Followers: 7, SJR: 2.37, h-index: 73)
Advances in Pediatrics     Full-text available via subscription   (Followers: 24, SJR: 0.4, h-index: 28)
Advances in Pharmaceutical Sciences     Full-text available via subscription   (Followers: 13)
Advances in Pharmacology     Full-text available via subscription   (Followers: 15, SJR: 1.718, h-index: 58)
Advances in Physical Organic Chemistry     Full-text available via subscription   (Followers: 8, SJR: 0.384, h-index: 26)
Advances in Phytomedicine     Full-text available via subscription  
Advances in Planar Lipid Bilayers and Liposomes     Full-text available via subscription   (Followers: 3, SJR: 0.248, h-index: 11)
Advances in Plant Biochemistry and Molecular Biology     Full-text available via subscription   (Followers: 8)
Advances in Plant Pathology     Full-text available via subscription   (Followers: 5)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Protein Chemistry     Full-text available via subscription   (Followers: 17)
Advances in Protein Chemistry and Structural Biology     Full-text available via subscription   (Followers: 20, SJR: 1.5, h-index: 62)
Advances in Psychology     Full-text available via subscription   (Followers: 61)
Advances in Quantum Chemistry     Full-text available via subscription   (Followers: 5, SJR: 0.478, h-index: 32)
Advances in Radiation Oncology     Open Access  
Advances in Small Animal Medicine and Surgery     Hybrid Journal   (Followers: 3, SJR: 0.1, h-index: 2)
Advances in Space Research     Full-text available via subscription   (Followers: 353, SJR: 0.606, h-index: 65)
Advances in Structural Biology     Full-text available via subscription   (Followers: 8)
Advances in Surgery     Full-text available via subscription   (Followers: 7, SJR: 0.823, h-index: 27)
Advances in the Study of Behavior     Full-text available via subscription   (Followers: 30, SJR: 1.321, h-index: 56)
Advances in Veterinary Medicine     Full-text available via subscription   (Followers: 17)
Advances in Veterinary Science and Comparative Medicine     Full-text available via subscription   (Followers: 13)
Advances in Virus Research     Full-text available via subscription   (Followers: 5, SJR: 1.878, h-index: 68)
Advances in Water Resources     Hybrid Journal   (Followers: 43, SJR: 2.408, h-index: 94)
Aeolian Research     Hybrid Journal   (Followers: 5, SJR: 0.973, h-index: 22)
Aerospace Science and Technology     Hybrid Journal   (Followers: 325, SJR: 0.816, h-index: 49)
AEU - Intl. J. of Electronics and Communications     Hybrid Journal   (Followers: 8, SJR: 0.318, h-index: 36)
African J. of Emergency Medicine     Open Access   (Followers: 5, SJR: 0.344, h-index: 6)
Ageing Research Reviews     Hybrid Journal   (Followers: 8, SJR: 3.289, h-index: 78)
Aggression and Violent Behavior     Hybrid Journal   (Followers: 405, SJR: 1.385, h-index: 72)
Agri Gene     Hybrid Journal  
Agricultural and Forest Meteorology     Hybrid Journal   (Followers: 15, SJR: 2.18, h-index: 116)
Agricultural Systems     Hybrid Journal   (Followers: 30, SJR: 1.275, h-index: 74)
Agricultural Water Management     Hybrid Journal   (Followers: 39, SJR: 1.546, h-index: 79)
Agriculture and Agricultural Science Procedia     Open Access  
Agriculture and Natural Resources     Open Access   (Followers: 1)
Agriculture, Ecosystems & Environment     Hybrid Journal   (Followers: 54, SJR: 1.879, h-index: 120)
Ain Shams Engineering J.     Open Access   (Followers: 5, SJR: 0.434, h-index: 14)
Air Medical J.     Hybrid Journal   (Followers: 5, SJR: 0.234, h-index: 18)
AKCE Intl. J. of Graphs and Combinatorics     Open Access   (SJR: 0.285, h-index: 3)
Alcohol     Hybrid Journal   (Followers: 10, SJR: 0.922, h-index: 66)
Alcoholism and Drug Addiction     Open Access   (Followers: 8)
Alergologia Polska : Polish J. of Allergology     Full-text available via subscription   (Followers: 1)
Alexandria Engineering J.     Open Access   (Followers: 1, SJR: 0.436, h-index: 12)
Alexandria J. of Medicine     Open Access  
Algal Research     Partially Free   (Followers: 8, SJR: 2.05, h-index: 20)
Alkaloids: Chemical and Biological Perspectives     Full-text available via subscription   (Followers: 3)
Allergologia et Immunopathologia     Full-text available via subscription   (Followers: 1, SJR: 0.46, h-index: 29)
Allergology Intl.     Open Access   (Followers: 4, SJR: 0.776, h-index: 35)
Alpha Omegan     Full-text available via subscription   (SJR: 0.121, h-index: 9)
ALTER - European J. of Disability Research / Revue Européenne de Recherche sur le Handicap     Full-text available via subscription   (Followers: 8, SJR: 0.158, h-index: 9)
Alzheimer's & Dementia     Hybrid Journal   (Followers: 48, SJR: 4.289, h-index: 64)
Alzheimer's & Dementia: Diagnosis, Assessment & Disease Monitoring     Open Access   (Followers: 6)
Alzheimer's & Dementia: Translational Research & Clinical Interventions     Open Access   (Followers: 5)
American Heart J.     Hybrid Journal   (Followers: 49, SJR: 3.157, h-index: 153)
American J. of Cardiology     Hybrid Journal   (Followers: 47, SJR: 2.063, h-index: 186)
American J. of Emergency Medicine     Hybrid Journal   (Followers: 39, SJR: 0.574, h-index: 65)
American J. of Geriatric Pharmacotherapy     Full-text available via subscription   (Followers: 8, SJR: 1.091, h-index: 45)
American J. of Geriatric Psychiatry     Hybrid Journal   (Followers: 15, SJR: 1.653, h-index: 93)
American J. of Human Genetics     Hybrid Journal   (Followers: 31, SJR: 8.769, h-index: 256)
American J. of Infection Control     Hybrid Journal   (Followers: 25, SJR: 1.259, h-index: 81)
American J. of Kidney Diseases     Hybrid Journal   (Followers: 32, SJR: 2.313, h-index: 172)
American J. of Medicine     Hybrid Journal   (Followers: 45, SJR: 2.023, h-index: 189)
American J. of Medicine Supplements     Full-text available via subscription   (Followers: 3)
American J. of Obstetrics and Gynecology     Hybrid Journal   (Followers: 237, SJR: 2.255, h-index: 171)
American J. of Ophthalmology     Hybrid Journal   (Followers: 57, SJR: 2.803, h-index: 148)
American J. of Ophthalmology Case Reports     Open Access   (Followers: 5)
American J. of Orthodontics and Dentofacial Orthopedics     Full-text available via subscription   (Followers: 6, SJR: 1.249, h-index: 88)
American J. of Otolaryngology     Hybrid Journal   (Followers: 25, SJR: 0.59, h-index: 45)
American J. of Pathology     Hybrid Journal   (Followers: 26, SJR: 2.653, h-index: 228)
American J. of Preventive Medicine     Hybrid Journal   (Followers: 22, SJR: 2.764, h-index: 154)
American J. of Surgery     Hybrid Journal   (Followers: 34, SJR: 1.286, h-index: 125)
American J. of the Medical Sciences     Hybrid Journal   (Followers: 12, SJR: 0.653, h-index: 70)
Ampersand : An Intl. J. of General and Applied Linguistics     Open Access   (Followers: 5)
Anaerobe     Hybrid Journal   (Followers: 4, SJR: 1.066, h-index: 51)
Anaesthesia & Intensive Care Medicine     Full-text available via subscription   (Followers: 57, SJR: 0.124, h-index: 9)
Anaesthesia Critical Care & Pain Medicine     Full-text available via subscription   (Followers: 11)
Anales de Cirugia Vascular     Full-text available via subscription  
Anales de Pediatría     Full-text available via subscription   (Followers: 2, SJR: 0.209, h-index: 27)
Anales de Pediatría (English Edition)     Full-text available via subscription  
Anales de Pediatría Continuada     Full-text available via subscription   (SJR: 0.104, h-index: 3)
Analytic Methods in Accident Research     Hybrid Journal   (Followers: 4, SJR: 2.577, h-index: 7)
Analytica Chimica Acta     Hybrid Journal   (Followers: 37, SJR: 1.548, h-index: 152)
Analytical Biochemistry     Hybrid Journal   (Followers: 166, SJR: 0.725, h-index: 154)
Analytical Chemistry Research     Open Access   (Followers: 8, SJR: 0.18, h-index: 2)
Analytical Spectroscopy Library     Full-text available via subscription   (Followers: 11)
Anesthésie & Réanimation     Full-text available via subscription   (Followers: 1)
Anesthesiology Clinics     Full-text available via subscription   (Followers: 22, SJR: 0.421, h-index: 40)
Angiología     Full-text available via subscription   (SJR: 0.124, h-index: 9)
Angiologia e Cirurgia Vascular     Open Access  
Animal Behaviour     Hybrid Journal   (Followers: 160, SJR: 1.907, h-index: 126)
Animal Feed Science and Technology     Hybrid Journal   (Followers: 5, SJR: 1.151, h-index: 83)
Animal Reproduction Science     Hybrid Journal   (Followers: 5, SJR: 0.711, h-index: 78)
Annales d'Endocrinologie     Full-text available via subscription   (Followers: 1, SJR: 0.394, h-index: 30)
Annales d'Urologie     Full-text available via subscription  
Annales de Cardiologie et d'Angéiologie     Full-text available via subscription   (SJR: 0.177, h-index: 13)
Annales de Chirurgie de la Main et du Membre Supérieur     Full-text available via subscription  
Annales de Chirurgie Plastique Esthétique     Full-text available via subscription   (Followers: 2, SJR: 0.354, h-index: 22)
Annales de Chirurgie Vasculaire     Full-text available via subscription   (Followers: 1)

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Journal Cover AKCE International Journal of Graphs and Combinatorics
  [SJR: 0.285]   [H-I: 3]   [0 followers]  Follow
    
  This is an Open Access Journal Open Access journal
   ISSN (Print) 0972-8600
   Published by Elsevier Homepage  [3043 journals]
  • On the size of edge chromatic 5-critical graphs

    • Authors: K. Kayathri; J. Sakila Devi
      Pages: 48 - 53
      Abstract: Publication date: April 2017
      Source:AKCE International Journal of Graphs and Combinatorics, Volume 14, Issue 1
      Author(s): K. Kayathri, J. Sakila Devi
      In this paper, we study the size of edge chromatic 5-critical graphs in several classes of 5-critical graphs. In most of the classes of 5-critical graphs in this paper, we have obtained their exact size and in the other classes of 5-critical graphs, we give new bounds on their number of major vertices and size.

      PubDate: 2017-04-26T18:49:02Z
      DOI: 10.1016/j.akcej.2016.11.003
       
  • Techniques for selecting topology and implementing the distributed control
           system network for maritime platforms

    • Authors: Chernyi Sergei
      Abstract: Publication date: Available online 6 October 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Chernyi Sergei
      Currently, there is an increased interest in the tools and methods of active control of generation and consumption of the inactive energy flows. Particularly, the task is relevant for autonomous electric power systems operating on a non-linear load. At the same time, the inactive energy flows is required to be controlled according to the specified law in order to impart the desired properties to autonomous systems. In general, with a high degree of automation on board the ships of the world fleet, the task of improving the efficiency of the automatic control of electricity quality remains urgent to them. This issue has arisen due to the fact that the semiconductor converters of electricity are becoming more widely used in the ship’s autonomous power systems. A scheme has been developed on the Ethernet platform for optimizing system performance of maritime platforms. The research was focused on the offshore platforms that operate in the Black Sea.

      PubDate: 2017-10-12T19:47:05Z
      DOI: 10.1016/j.akcej.2017.09.005
       
  • Big data storage configuration and performance evaluation utilizing NDAS
           storage systems

    • Authors: Jung Kyu Park; Jaeho Kim
      Abstract: Publication date: Available online 6 October 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Jung Kyu Park, Jaeho Kim
      Recently, a large amount of multimedia data is rapidly increasing due to cloud activation. For this reason, there is a need for a technique capable of handling large amounts of data and large storage devices. In this way, a network storage device such as a NAS or a SAN is used to configure a large-capacity storage device in a network environment. In this paper, a large capacity storage device is constructed by using network direct connection storage device. We performed benchmark experiments to verify the scalability of the constructed storage devices using network direct attached storage.

      PubDate: 2017-10-12T19:47:05Z
      DOI: 10.1016/j.akcej.2017.09.003
       
  • Some results on the independence number of connected domination critical
           graphs

    • Authors: Kaemawichanurat Jiarasuksakun
      Abstract: Publication date: Available online 4 October 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): P. Kaemawichanurat, T. Jiarasuksakun
      A k - γ c -critical graph is a graph G with connected domination number γ c ( G ) = k and γ c ( G + u v ) < k for any pair of non-adjacent vertices u and v of G . Let ω and α be respectively the clique number and the independence number of a graph. In this paper, we prove that every k - γ c -critical graph satisfies α + ω ≤ n − ⌊ k 2 ⌋ + 1 for 1 ≤ k ≤ 3 . We also characterize all 3 - γ c -critical graphs achieving the upper bound. For k ≥ 4 , we show that there are infinitely many k - γ c -critical graphs satisfying α + ω = n − ⌊ k 2 ⌋ + 1 . Thus, we conclude this paper with an open problem that every k - γ c -critical graph for k ≥ 4 satisfies α + ω ≤ n − ⌊ k 2 ⌋ + 1 .

      PubDate: 2017-10-06T01:41:32Z
       
  • On Ramsey (4K2,P3)-minimal graphs

    • Authors: Kristiana Wijaya; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto
      Abstract: Publication date: Available online 28 September 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto
      Let F , G , and H be simple graphs. We write F → ( G , H ) to mean that any red–blue coloring of all edges of F will contain either a red copy of G or a blue copy of H . A graph F (without isolated vertices) satisfying F → ( G , H ) and for each e ∈ E ( F ) , ( F − e ) ↛ ( G , H ) is called a Ramsey ( G , H ) -minimal graph. The set of all Ramsey ( G , H ) -minimal graphs is denoted by ℛ ( G , H ) . In this paper, we derive the necessary and sufficient condition of graphs belonging to ℛ ( 4 K 2 , H ) , for any connected graph H . Moreover, we give a relation between Ramsey ( 4 K 2 , P 3 ) - and ( 3 K 2 , P 3 ) -minimal graphs, and Ramsey ( 4 K 2 , P 3 ) - and ( 2 K 2 , P 3 ) -minimal graphs. Furthermore, we determine all graphs in ℛ ( 4 K 2 , P 3 ) .

      PubDate: 2017-10-06T01:41:32Z
      DOI: 10.1016/j.akcej.2017.08.003
       
  • Bend-optimal orthogonal drawings of triconnected plane graphs

    • Authors: Siddharth Bhatia; Kunal Lad; Rajiv Kumar
      Abstract: Publication date: Available online 12 September 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Siddharth Bhatia, Kunal Lad, Rajiv Kumar
      A drawing of a plane graph G in which each edge is represented by a sequence of alternating horizontal and vertical line segments is called an orthogonal drawing. The points of intersection of horizontal and vertical line segments of an edge in an orthogonal drawing are called bends. The best known algorithm to find a bend-optimal orthogonal drawing of a plane graph takes time O ( n 1 . 5 ) where n is the number of vertices in the graph. In this paper we present a new linear time algorithm to find an orthogonal drawing of a plane 3-connected graph (with maximum degree 4) and give bounds on number of bends (in terms of number k of degree-4 vertices in the graph) in the resulting drawing with respect to the number b ( G ) of bends in the bend-optimal orthogonal drawing of the same graph. The bound is b ( G ) + 3 k .

      PubDate: 2017-09-16T06:16:48Z
      DOI: 10.1016/j.akcej.2017.08.001
       
  • A note on the Ramsey numbers for theta graphs versus the wheel of order 5

    • Authors: Mohammed M.M. Jaradat; Mohammad S. Bataineh; Tomáš Vetrík; Ayat M.M. Rabaiah
      Abstract: Publication date: Available online 11 September 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Mohammed M.M. Jaradat, Mohammad S. Bataineh, Tomáš Vetrík, Ayat M.M. Rabaiah
      The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R ( S , F ) is the smallest positive integer r such that for every graph G on r vertices, G contains a graph in S as a subgraph or the complement of G contains F as a subgraph. Ramsey numbers of various graphs including theta graphs and wheels have been extensively studied. We extend known results in the area by presenting exact values of the Ramsey numbers R ( θ n , W 5 ) for n ≥ 7 , where θ n is the set of theta graphs of order n and W 5 is the wheel graph of order 5 .

      PubDate: 2017-09-16T06:16:48Z
      DOI: 10.1016/j.akcej.2017.08.002
       
  • Inverse sum indeg index of graphs

    • Authors: K. Pattabiraman
      Abstract: Publication date: Available online 15 August 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): K. Pattabiraman
      The inverse sum indeg index I S I ( G ) of a simple graph G is defined as the sum of the terms d G ( u ) d G ( v ) d G ( u ) + d G ( v ) over all edges u v of G , where d G ( u ) denotes the degree of a vertex u of G . In this paper, we present several upper and lower bounds on the inverse sum indeg index in terms of some molecular structural parameters and relate this index to various well-known molecular descriptors.

      PubDate: 2017-09-04T10:04:28Z
      DOI: 10.1016/j.akcej.2017.06.001
       
  • L(j,k)-labeling numbers of square of paths

    • Authors: Qiong Wu; Wai Chee Shiu
      Abstract: Publication date: Available online 14 August 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Qiong Wu, Wai Chee Shiu
      For j ≤ k , the L ( j , k ) -labeling arose from code assignment problem. That is, let j , k and m be positive numbers, an m - L ( j , k ) -labeling of a graph G is a mapping f : V ( G ) → [ 0 , m ] such that f ( u ) − f ( v ) ≥ j if d ( u , v ) = 1 , and f ( u ) − f ( v ) ≥ k if d ( u , v ) = 2 . The span of f is the difference between the maximum and the minimum numbers assigned by f . The L ( j , k ) -labeling number of G , denoted by λ j , k ( G ) , is the minimum span over all L ( j , k ) -labelings of G . The k th power G k of an undirected graph G is the graph with the vertex set of G in which two vertices are adjacent when their distance in G is at most k . In this paper, the L ( j , k ) -labeling numbers of P n 2 are determined for j ≤ k .

      PubDate: 2017-09-04T10:04:28Z
      DOI: 10.1016/j.akcej.2017.07.001
       
  • Alliances in graphs: Parameters, properties and applications—A
           survey

    • Authors: Kahina Ouazine; Hachem Slimani; Abdelkamel Tari
      Abstract: Publication date: Available online 9 June 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Kahina Ouazine, Hachem Slimani, Abdelkamel Tari
      In practice, an alliance can be a bond or connection between individuals, families, states, or entities, etc. Formally, a non-empty set S of vertices of a graph G is a defensive k -alliance (resp. an offensive k -alliance) if every vertex of S (resp. the boundary of S ) has at least k more neighbors inside of S than it has outside of S . A powerful k -alliance is both defensive k -alliance and offensive ( k + 2 ) -alliance. During the last decade there has been a remarkable development on these three kinds of alliances. Due to their variety of applications, the alliances in its broad sense have received a special attention from many scientists and researchers. There have been applications of alliances in several areas such as bioinformatics, distributed computing, web communities, social networks, data clustering, business, etc. Several k -alliance numbers have been defined and a huge number of theoretical (algorithmic and computational) results are obtained for various graph classes. In this paper, we present a survey which covers a number of practical applications of alliances and the vast mathematical properties of the three types of k -alliances by giving a special attention to the study of the associated k -alliance (partition) numbers for different graph classes.

      PubDate: 2017-06-12T20:47:55Z
      DOI: 10.1016/j.akcej.2017.05.002
       
  • A graph theoretic analysis of leverage centrality

    • Authors: Roger Vargas; Abigail Waldron Anika Sharma Rigoberto Darren Narayan
      Abstract: Publication date: Available online 7 June 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Roger Vargas, Abigail Waldron, Anika Sharma, Rigoberto Flórez, Darren A. Narayan
      In 2010, Joyce et al. defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a vertex is compared to the degrees of all it neighbors. We investigate this property from a mathematical perspective. We first outline some of the basic properties and then compute leverage centralities of vertices in different families of graphs. In particular, we show there is a surprising connection between the number of distinct leverage centralities in the Cartesian product of paths and the triangle numbers.

      PubDate: 2017-06-12T20:47:55Z
       
  • Distance antimagic labeling of join and corona of two graphs

    • Authors: A.K. Handa; Aloysius Godinho; T. Singh; S. Arumugam
      Abstract: Publication date: Available online 19 May 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): A.K. Handa, Aloysius Godinho, T. Singh, S. Arumugam
      Let G be a graph of order n . Let f : V ( G ) ⟶ { 1 , 2 , … , n } be a bijection. The weight w f ( v ) of a vertex v with respect to f is defined by w f ( v ) = ∑ x ∈ N ( v ) f ( x ) , where N ( v ) is the open neighborhood of v . The labeling f is said to be distance antimagic if w f ( u ) ≠ w f ( v ) for every pair of distinct vertices u , v ∈ V ( G ) . If the graph G admits such a labeling, then G is said to be a distance antimagic graph. In this paper we investigate the existence of distance antimagic labelings of G + H and G ∘ H .

      PubDate: 2017-05-24T01:28:59Z
      DOI: 10.1016/j.akcej.2017.04.003
       
  • Minimal 2-point set dominating sets of a graph

    • Authors: Deepti Jain; Purnima Gupta; S. Arumugam
      Abstract: Publication date: Available online 18 May 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Deepti Jain, Purnima Gupta, S. Arumugam
      A set D ⊆ V ( G ) is a 2-point set dominating set (2-psd set) of a graph G if for any subset S ⊆ V − D , there exists a non-empty subset T ⊆ D containing at most two vertices such that the induced subgraph 〈 S ∪ T 〉 is connected. In this paper we characterize minimal 2-psd sets for a general graph. Based on the structure we examine 2-psd sets in a separable graph and discuss the criterion for a 2-psd set to be minimal.

      PubDate: 2017-05-24T01:28:59Z
      DOI: 10.1016/j.akcej.2017.03.008
       
  • m-dominating k-ended trees of l-connected graphs

    • Authors: Masao Tsugaki; Guiying Yan
      Abstract: Publication date: Available online 17 May 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Masao Tsugaki, Guiying Yan
      Let k ≥ 2 , l ≥ 1 and m ≥ 0 be integers, and let G be an l -connected graph. If there exists a subgraph X of G such that the distance between v and X is at most m for any v ∈ V ( G ) , then we say that X m -dominates G . A subset S of V ( G ) is said to be 2 ( m + 1 ) -stable if the distance between each pair of distinct vertices in S is at least 2 ( m + 1 ) . In this paper, we prove that if G does not have a 2 ( m + 1 ) -stable set of order at least k + l , then G has an m -dominating tree which has at most k leaves.

      PubDate: 2017-05-18T19:54:14Z
      DOI: 10.1016/j.akcej.2017.04.004
       
  • An improved bound for negative binomial approximation with z-functions

    • Authors: K. Teerapabolarn
      Abstract: Publication date: Available online 11 May 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): K. Teerapabolarn
      In this article, we use Stein’s method together with z -functions to give an improved bound for the total variation distance between the distribution of a non-negative integer-valued random variable X and the negative binomial distribution with parameters r ∈ R + and p = 1 − q ∈ ( 0 , 1 ) , where r q p is equal to the mean of X , E ( X ) . The improved bound is sharper than that mentioned in Teerapabolarn and Boondirek (2010). We give three examples of the negative binomial approximation to the distribution of X concerning the negative hypergeometric, Pólya and negative Pólya distributions.

      PubDate: 2017-05-13T17:13:50Z
      DOI: 10.1016/j.akcej.2017.04.005
       
  • On cyclic orthogonal double covers of circulant graphs by special infinite
           graphs

    • Authors: R. El-Shanawany; A. El-Mesady
      Abstract: Publication date: Available online 2 May 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): R. El-Shanawany, A. El-Mesady
      In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K 1 , 2 n − 10 is introduced.

      PubDate: 2017-05-04T04:32:18Z
      DOI: 10.1016/j.akcej.2017.04.002
       
  • Some new upper bounds of ex(n;{C3,C4})

    • Authors: Novi H. Bong
      Abstract: Publication date: Available online 2 May 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Novi H. Bong
      The extremal number e x ( n ; { C 3 , C 4 } ) or simply e x ( n ; 4 ) denotes the maximal number of edges in a graph on n vertices with forbidden subgraphs C 3 and C 4 . The exact number of e x ( n ; 4 ) is only known for n up to 32 and n = 50 . There are upper and lower bounds of e x ( n ; 4 ) for other values of n . In this paper, we improve the upper bound of e x ( n ; 4 ) for n = 33 , 34 , … , 42 and also n = d 2 + 1 for any positive integer d ≠ 7 , 57 .

      PubDate: 2017-05-04T04:32:18Z
      DOI: 10.1016/j.akcej.2017.03.006
       
  • On total directed graphs of non-commutative rings

    • Authors: Kukil Kalpa Rajkhowa; Helen K. Saikia
      Abstract: Publication date: Available online 28 April 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Kukil Kalpa Rajkhowa, Helen K. Saikia
      For a non-commutative ring R , the left total directed graph of R is a directed graph with vertex set as R and for the vertices x and y , x is adjacent to y if and only if there is a non-zero r ∈ R which is different from x and y , such that r x + y r is a left zero-divisor of R . In this paper, we discuss some very basic results of left (as well as right) total directed graph of R . We also study the coloring of left total directed graph of R directed graph.

      PubDate: 2017-05-04T04:32:18Z
      DOI: 10.1016/j.akcej.2017.04.001
       
  • Edge odd graceful labeling of some path and cycle related graphs

    • Authors: S.N. Daoud
      Abstract: Publication date: Available online 24 April 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): S.N. Daoud
      Solairaju and Chithra introduced a new type of labeling of a graph G with p vertices and q edges called an edge odd graceful labeling if there is a bijection f from the edges of the graph to the set { 1 , 3 , … , 2 q − 1 } such that, when each vertex is assigned the sum of all edges incident to it m o d 2 k , where k = max ( p , q ) , the resulting vertex labels are distinct. In this paper we proved necessary and sufficient conditions for some path and cycle related graphs to be edge odd graceful such as: Friendship graphs, Wheel graph, Helm graph, Web graph, Double wheel graph, Gear graph, Fan graph, Double fan graph and Polar grid graph.

      PubDate: 2017-04-26T18:49:02Z
      DOI: 10.1016/j.akcej.2017.03.001
       
  • Edges and vertices in a unique signed circle in a signed graph

    • Authors: Richard Behr
      Abstract: Publication date: Available online 12 April 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Richard Behr
      We examine the conditions under which a signed graph contains an edge or a vertex that is contained in a unique negative circle or a unique positive circle. For an edge in a unique signed circle, the positive and negative case require the same structure on the underlying graph, but the requirements on the signature are different. We characterize the structure of the underlying graph necessary to support such an edge in terms of bridges of a circle. We then use the results from the edge version of the problem to help solve the vertex version.

      PubDate: 2017-04-19T14:59:29Z
      DOI: 10.1016/j.akcej.2017.03.004
       
  • The forcing total restrained geodetic number and the total restrained
           geodetic number of a graph: Realizability and complexity

    • Authors: H. Abdollahzadeh Ahangar; M. Najimi; V. Samodivkin; Ismael G. Yero
      Abstract: Publication date: Available online 11 April 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): H. Abdollahzadeh Ahangar, M. Najimi, V. Samodivkin, Ismael G. Yero
      Given two vertices u and v of a nontrivial connected graph G , the set I [ u , v ] consists all vertices lying on some u − v geodesic in G , including u and v . For S ⊆ V ( G ) , the set I [ S ] is the union of all sets I [ u , v ] for u , v ∈ S . A set S ⊆ V ( G ) is a total restrained geodetic set of G if I [ S ] = V ( G ) and the subgraphs induced by S and V ( G ) − S have no isolated vertex. The minimum cardinality of a total restrained geodetic set of G is the total restrained geodetic number g t r ( G ) of G and a total restrained geodetic set of G whose cardinality equals g t r ( G ) is a minimum total restrained geodetic set of G . A subset T of a minimum total restrained geodetic set S is a forcing subset for S if S is the unique minimum total restrained geodetic set of G containing T . The forcing total restrained geodetic number f t r ( S ) of S is the minimum cardinality of a forcing subset of S and the forcing total restrained geodetic number f t r ( G ) of G is the minimum forcing total restrained geodetic number among all minimum total restrained geodetic sets of G . In this article we determine all pairs a , b of integers such that f t r ( G ) = a and
      PubDate: 2017-04-19T14:59:29Z
      DOI: 10.1016/j.akcej.2017.03.007
       
  • Connected minimum secure-dominating sets in grids

    • Authors: Johnathan Barnett; Adam Blumenthal; Peter Johnson; Cadavious Jones; Ryan Matzke; Egbert Mujuni
      Abstract: Publication date: Available online 31 March 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Johnathan Barnett, Adam Blumenthal, Peter Johnson, Cadavious Jones, Ryan Matzke, Egbert Mujuni
      For any (finite simple) graph G the secure domination number of G satisfies γ s ( G ) ≥ V ( G ) 2 . Here we find a secure-dominating set S in G such that S = ⌈ V ( G ) 2 ⌉ in all cases when G is a grid, and in the majority of cases when G is a cylindrical or toroidal grid. In all such cases, S satisfies the additional requirement that G [ S ] is connected. We make note that the concept of secure-dominating sets considered in this paper is quite different from the other secure domination currently of interest. 1 1 The other sort of secure domination: A dominating set S ⊆ V ( G ) is secure dominating (in G) if and only if for every v ∈ V ( G ) ∖ S there is some u ∈ S such that ( S ∖ { u } ) ∪ { v } is dominating, in G.

      PubDate: 2017-04-04T18:32:51Z
      DOI: 10.1016/j.akcej.2017.03.003
       
  • L(3,2,1)- and L(4,3,2,1)-labeling problems on interval graphs

    • Authors: Sk Amanathulla; Madhumangal Pal
      Abstract: Publication date: Available online 23 March 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Sk Amanathulla, Madhumangal Pal
      For a given graph G = ( V , E ) , the L ( 3 , 2 , 1 ) - and L ( 4 , 3 , 2 , 1 ) -labeling problems assign the labels to the vertices of G . Let Z ∗ be the set of non-negative integers. An L ( 3 , 2 , 1 ) - and L ( 4 , 3 , 2 , 1 ) -labeling of a graph G is a function f : V → Z ∗ such that f ( x ) − f ( y ) ≥ k − d ( x , y ) , for k = 4 , 5 respectively, where d ( x , y ) represents the distance (minimum number of edges) between the vertices x and y , and 1 ≤ d ( x , y ) ≤ k − 1 . The L ( 3 , 2 , 1 ) - and L ( 4 , 3 , 2 , 1 ) -labeling numbers of a graph G , are denoted by λ 3 , 2 , 1 ( G ) and λ 4 , 3 , 2 , 1 ( G ) and they are the difference between highest and lowest labels used in L ( 3 , 2 , 1 ) - and L ( 4 , 3 , 2 , 1 ) -labeling respectively. In this paper, for an interval graph G , it is shown that λ 3 , 2 , 1 ( G ) ≤ 6 Δ − 3 and λ 4 , 3 , 2 , 1 ( G ) ≤ 10 Δ − 6 , where Δ represents the maximum degree of the vertices of G . Also, two algorithms are designed to label an interval graph by maintaining L ( 3 , 2 , 1 ) - and L ( 4 , 3 , 2 , 1 ) -labeling conditio...
      PubDate: 2017-03-28T21:45:39Z
      DOI: 10.1016/j.akcej.2017.03.002
       
  • On the genus of graphs from commutative rings

    • Authors: S. Kavitha; R. Kala
      Abstract: Publication date: Available online 22 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): S. Kavitha, R. Kala
      Let R be a commutative ring with non-zero identity. The cozero-divisor graph of R , denoted by Γ ′ ( R ) , is a graph with vertex-set W ∗ ( R ) , which is the set of all non-zero non-unit elements of R , and two distinct vertices x and y in W ∗ ( R ) are adjacent if and only if x ∉ R y and y ∉ R x , where for z ∈ R , R z is the ideal generated by z . In this paper, we determine all isomorphism classes of finite commutative rings R with identity whose Γ ′ ( R ) has genus one. Also we characterize all non-local rings for which the reduced cozero-divisor graph Γ r ( R ) is planar.

      PubDate: 2017-02-25T15:03:00Z
      DOI: 10.1016/j.akcej.2016.11.006
       
  • Super (a,d)-edge antimagic total labeling of a subclass of trees

    • Authors: M. Javaid; A.A. Bhatti; M.K. Aslam
      Abstract: Publication date: Available online 21 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): M. Javaid, A.A. Bhatti, M.K. Aslam
      A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges. A labeling in which domain is the set of vertices and edges is called a total labeling. For a graph G with the vertex set V ( G ) and the edge set E ( G ) , a total labeling f : V ( G ) ∪ E ( G ) → { 1 , 2 , 3 , … , V ( G ) + E ( G ) } is called an ( a , d ) -edge antimagic total labeling if the set of edge weights { f ( x ) + f ( x y ) + f ( y ) : x y ∈ E ( G ) } forms an arithmetic progression with initial term a and common difference d . An ( a , d ) -edge antimagic total labeling is called a super ( a , d ) -edge antimagic total labeling if the smallest labels are assigned to the vertices. In this paper, we investigate the super ( a , d ) -edge-antimagic total labeling of a subclass of trees called subdivided stars for all possible values of d , mainly d = 1 , 3 .

      PubDate: 2017-02-25T15:03:00Z
      DOI: 10.1016/j.akcej.2017.02.001
       
  • Infinite kernel perfect digraphs

    • Abstract: Publication date: Available online 21 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Rocío Sánchez-López
      Let D be a digraph, possibly infinite, V( D ) and A( D ) will denote the sets of vertices and arcs of D , respectively. A subset K of V( D ) is said to be a kernel if it is both independent (a vertex in K has no successor in K ) and absorbing (a vertex not in K has a successor in K ). An infinite digraph D is said to be a finitely critical kernel imperfect digraph if D contains no kernel but every finite induced subdigraph of D contains a kernel. In this paper we will characterize the infinite kernel perfect digraphs by means of finitely critical imperfect digraphs and strong components of its asymmetric part and then, by using some previous theorems for infinite digraphs, we will deduce several results from the main result. Richardson’s theorem establishes that if D is a finite digraph without cycles of odd length, then D has a kernel. In this paper we will show a generalization of this theorem for infinite digraphs.

      PubDate: 2017-02-25T15:03:00Z
       
  • On 3-total edge product cordial labeling of honeycomb

    • Authors: Ali Ahmad; Martin Maria Naseem Andrea
      Abstract: Publication date: Available online 21 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Ali Ahmad, Martin Bača, Maria Naseem, Andrea Semaničová-Feňovčíková
      For a graph G = ( V ( G ) , E ( G ) ) , an edge labeling φ : E ( G ) → { 0 , 1 , … , k − 1 } where k is an integer, 2 ≤ k ≤ E ( G ) , induces a vertex labeling φ ∗ : V ( G ) → { 0 , 1 , … , k − 1 } defined by φ ∗ ( v ) = φ ( e 1 ) ⋅ φ ( e 2 ) ⋅ … ⋅ φ ( e n ) ( mod k ) , where e 1 , e 2 , … , e n are the edges incident to the vertex v . The function φ is called a k -total edge product cordial labeling of G if ( e φ ( i ) + v φ ∗ ( i ) ) − ( e φ ( j ) + v φ ∗ ( j ) ) ≤ 1 for every i , j , 0 ≤ i < j ≤ k − 1 , where e φ ( i ) and v φ ∗ ( i ) are the number of edges e and vertices v with φ ( e ) = i and φ ∗ ( v ) = i , respectively. In this paper, we investigate the existence of 3 -total edge product cordial labeling of hexagonal grid.

      PubDate: 2017-02-25T15:03:00Z
       
  • Color signless Laplacian energy of graphs

    • Authors: Pradeep G. Bhat; Sabitha D’Souza
      Abstract: Publication date: Available online 17 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Pradeep G. Bhat, Sabitha D’Souza
      In this paper, we introduce the new concept of color Signless Laplacian energy L E c + ( G ) . It depends on the underlying graph G and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families of graph with the minimum number of colors. The color signless Laplacian energy for the complement of some colored graphs is also obtained.

      PubDate: 2017-02-18T16:32:17Z
      DOI: 10.1016/j.akcej.2017.02.003
       
  • The Hadwiger number, chordal graphs and ab-perfection

    • Authors: Christian Rubio-Montiel
      Abstract: Publication date: Available online 16 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Christian Rubio-Montiel
      A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs such that for each induced subgraph H , (1) the Hadwiger number of H is equal to the maximum clique order of H , (2) the Hadwiger number of H is equal to the achromatic number of H , (3) the b -chromatic number is equal to the pseudoachromatic number, (4) the pseudo- b -chromatic number is equal to the pseudoachromatic number, (5) the Hadwiger number of H is equal to the Grundy number of H , and (6) the b -chromatic number is equal to the pseudo-Grundy number.

      PubDate: 2017-02-18T16:32:17Z
      DOI: 10.1016/j.akcej.2017.02.004
       
  • Hybrid methods for a finite family of G-nonexpansive mappings in Hilbert
           spaces endowed with graphs

    • Authors: Raweerote Suparatulatorn; Suthep Suantai; Watcharaporn Cholamjiak
      Abstract: Publication date: Available online 15 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Raweerote Suparatulatorn, Suthep Suantai, Watcharaporn Cholamjiak
      In this paper, we prove a strong convergence theorem for two different hybrid methods by using CQ method for a finite family of G-nonexpansive mappings in a Hilbert space. We give an example and numerical results for supporting our main results and compare the rate of convergence of the two iterative methods.

      PubDate: 2017-02-18T16:32:17Z
      DOI: 10.1016/j.akcej.2017.01.001
       
  • Construction of an α-labeled tree from a given set of α-labeled
           trees

    • Authors: Sethuraman Ragukumar
      Abstract: Publication date: Available online 14 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): G. Sethuraman, P. Ragukumar
      Inspired by the method of Koh et al. (1979) of combining known graceful trees to construct bigger graceful trees, a new class of graceful trees is constructed from a set of k known graceful trees, k ≥ 2 in a specific way. In fact, each member of this new class of trees admits α -labeling, a stronger version of graceful labeling. Consequently, each member of this family of trees decomposes complete graphs and complete bipartite graphs.

      PubDate: 2017-02-18T16:32:17Z
       
  • General sum-connectivity index, general product-connectivity index,
           general Zagreb index and coindices of line graph of subdivision graphs

    • Authors: Harishchandra S. Ramane; Vinayak V. Manjalapur; Ivan Gutman
      Abstract: Publication date: Available online 12 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Harishchandra S. Ramane, Vinayak V. Manjalapur, Ivan Gutman
      The general sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graphs of subdivision graphs of tadpole graphs, wheels and ladders have been reported in the literature. In this paper, we obtain general expressions for these topological indices for the line graph of the subdivision graphs, thus generalizing the existing results.

      PubDate: 2017-02-18T16:32:17Z
      DOI: 10.1016/j.akcej.2017.01.002
       
  • Some notes on the isolate domination in graphs

    • Authors: Nader Jafari Rad
      Abstract: Publication date: Available online 6 February 2017
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Nader Jafari Rad
      A subset S of vertices of a graph G is a dominating set of G if every vertex in V ( G ) − S has a neighbor in S . The domination number γ ( G ) is the minimum cardinality of a dominating set of G . A dominating set S is an isolate dominating set if the induced subgraph G [ S ] has at least one isolated vertex. The isolate domination number γ 0 ( G ) is the minimum cardinality of an isolate dominating set of G . In this paper we study the complexity of the isolate domination in graphs, and obtain several bounds and characterizations on the isolate domination number, thus answering some open problems.

      PubDate: 2017-02-12T00:43:17Z
      DOI: 10.1016/j.akcej.2017.01.003
       
  • Weighted approximate parameterized string matching

    • Authors: Shibsankar Das; Kalpesh Kapoor
      Abstract: Publication date: Available online 29 December 2016
      Source:AKCE International Journal of Graphs and Combinatorics
      Author(s): Shibsankar Das, Kalpesh Kapoor
      We consider the problem of finding a bijection to match a pattern in a text where both the pattern and the text are strings from distinct alphabets. The objective of weighted approximate parameterized string matching problem is to find approximate parameterized pattern of length m match under weighted Hamming distance in a text of length n . Our main result is an O ( n m ) time algorithm for this problem. We also investigate string comparison problem with k threshold under weighted Hamming distance and give a O ( m + k ) time solution. All the above time complexities assume constant size alphabets.

      PubDate: 2017-01-06T04:11:18Z
      DOI: 10.1016/j.akcej.2016.11.010
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.80.236.48
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016