‎in this paper we defined the vertex removable cycle in respect of the following‎, ‎if $f$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$g in f $‎, ‎the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $.‎ ‎the vertex removable cycles of eulerian graphs are studied‎. ‎we also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎

This paper examines the city of Steelport in Saints Row: The Third (Volition, 2011) as a real-and-imagined space that can be described using an urban framework of constitutional, representational, and experiential components. It relates mediated and physical cities through spatial arrangement, processes of representation, and the factors that contribute to a sense of place in both material and ...

The gift-exchange game has established that, in the laboratory, higher wages offered by an employer lead to considerably more costly effort provision. However, it is unclear whether this behavior reflects reciprocity or other forms of social preferences. This article tests whether attribution of volition in choosing a wage has a significant effect on subsequent costly effort provision. Treatmen...

Introduction Conclusions References Tables Figures Back Close Full Screen / Esc Printer-friendly Version Interactive Discussion EGU Abstract Subsurface temperatures in Bangkok, where population and density increase rapidly, were analyzed to evaluate the effects of surface warming due to urbanization. The magnitude of surface warming evaluated from subsurface temperature in Bangkok was 1.7 • C w...

This paper explains how we define and represent modality in E-HowNet. Following Lyons (1977, reviewed in Hsieh 2003, among others), we hold that modals express a speaker’s opinion or attitude toward a proposition and hence have a pragmatic dimension and recognize five kinds of modal categories, i.e. epistemic, deontic, ability, volition and expectation modality. We then present a representation...

A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...

Introduction Conclusions References Tables Figures ◭ ◮ ◭ ◮ Back Close Full Screen / Esc Abstract Introduction Conclusions References Tables Figures ◭ ◮ ◭ ◮ Back Close Full Screen / Esc Printer-friendly Version Interactive Discussion EGU Abstract The Planet Simulator was used to perform equilibrium simulations of the Eemian inter-glacial at 125 kyBP and the glacial inception at 115 kyBP. Additio...

The vertex arboricity $rho(G)$ of a graph $G$ is the minimum number of subsets into which the vertex set $V(G)$ can be partitioned so that each subset induces an acyclic graph‎. ‎A graph $G$ is called list vertex $k$-arborable if for any set $L(v)$ of cardinality at least $k$ at each vertex $v$ of $G$‎, ‎one can choose a color for each $v$ from its list $L(v)$ so that the subgraph induced by ev...

recently, hua et al. defined a new topological index based on degrees and inverse ofdistances between all pairs of vertices. they named this new graph invariant as reciprocaldegree distance as 1{ , } ( ) ( ( ) ( ))[ ( , )]rdd(g) = u v v g d u  d v d u v , where the d(u,v) denotesthe distance between vertices u and v. in this paper, we compute this topological index forgrassmann graphs.

the zagreb indices are the oldest graph invariants used in mathematical chemistry to predictthe chemical phenomena. in this paper we define the multiple versions of zagreb indicesbased on degrees of vertices in a given graph and then we compute the first and secondextremal graphs for them.