Identifying parallelism in programs with cyclic graphs

2002 ◽  
Author(s):  
Yuan-Shin Hwang ◽  
J. Saltz
Keyword(s):  
Cyclic Graphs

Bounds on hyper-Wiener index of graphs

2017 ◽  
Vol 10 (03) ◽  
pp. 1750057
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Sadegh Rahimi
Keyword(s):  
Lower Bounds ◽  
Organic Molecules ◽  
Wiener Index ◽  
Upper And Lower Bounds ◽  
Pharmacological Properties ◽  
Graph Theoretic ◽  
Acyclic Graphs ◽  
Wiener Number ◽  
Number Formula ◽  
Cyclic Graphs

The Wiener number [Formula: see text] of a graph [Formula: see text] was introduced by Harold Wiener in connection with the modeling of various physic-chemical, biological and pharmacological properties of organic molecules in chemistry. Milan Randić introduced a modification of the Wiener index for trees (acyclic graphs), and it is known as the hyper-Wiener index. Then Klein et al. generalized Randić’s definition for all connected (cyclic) graphs, as a generalization of the Wiener index, denoted by [Formula: see text] and defined as [Formula: see text]. In this paper, we establish some upper and lower bounds for [Formula: see text], in terms of other graph-theoretic parameters. Moreover, we compute hyper-Wiener number of some classes of graphs.

scholarly journals The nullity of(k-1)-cyclic graphs

2013 ◽  
Vol 438 (7) ◽  
pp. 3144-3153 ◽  
Author(s):  
Xuezhong Tan ◽  
Bolian Liu
Keyword(s):  
Cyclic Graphs

scholarly journals Group-antimagic Labelings of Multi-cyclic Graphs

2016 ◽  
Vol 3 (1) ◽  
Author(s):  
Dan Roberts ◽  
Richard Low
Keyword(s):  
Cyclic Graphs

scholarly journals Financial networks as directed cyclic graphs - draft

2014 ◽  
Vol 11 (4) ◽  
pp. 520-529 ◽  
Author(s):  
Alexander Denev
Keyword(s):  
Computer Science ◽  
Graphical Models ◽  
Network Theory ◽  
Probabilistic Graphical Models ◽  
Financial Networks ◽  
New Approach ◽  
Global Properties ◽  
Cyclic Graphs

Financial networks’ study and understanding has become extremely important since the global financial meltdown in 2007-2009 when the inter-connectedness of institutions has surfaced as one of the major culprits for the magnitude of the distress. This paper aims at providing a new approach to describe and better understand the networks of institutions and their global properties. It is based on Directed Cyclic Graphs - a subset of Probabilistic Graphical Models which have already found use in other domains such as physics and computer science. The paper draws some parallels and contrasts with other studies in the field of Network Theory. It then concludes with a stylized example.

Highway games on weakly cyclic graphs

2010 ◽  
Vol 204 (1) ◽  
pp. 117-124 ◽  
Author(s):  
Barış Çiftçi ◽  
Peter Borm ◽  
Herbert Hamers
Keyword(s):  
Cyclic Graphs

Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles

2019 ◽  
Vol 29 (04) ◽  
pp. 1950016
Author(s):  
Ajay Arora ◽  
Eddie Cheng ◽  
Colton Magnant
Keyword(s):  
Connected Graph ◽  
The Other ◽  
Complete Graphs ◽  
Specific Class ◽  
Proper Coloring ◽  
Cartesian Products ◽  
General Graph ◽  
Proper Distance ◽  
Cyclic Graphs

An path that is edge-colored is called proper if no two consecutive edges receive the same color. A general graph that is edge-colored is called properly connected if, for every pair of vertices in the graph, there exists a properly colored path from one to the other. Given two vertices u and v in a properly connected graph G, the proper distance is the length of the shortest properly colored path from u to v. By considering a specific class of colorings that are properly connected for Cartesian products of complete and cyclic graphs, we present results on the proper distance between all pairs of vertices in the graph.

Sign in / Sign up

Export Citation Format

Share Document