recently, e. m'{a}v{c}ajov'{a} and m. v{s}koviera proved that every bidirected eulerian graph which admits a nowhere zero flow, admits a nowhere zero $4$-flow. this result shows the validity of bouchet's nowhere zero conjecture for eulerian bidirected graphs. in this paper we prove the same theorem in a different terminology and with a short and simple proof. more precisely, we p...

in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...

The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...

the eccentricity connectivity index of a molecular graph g is defined as (g) = av(g)deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to othervertices of g and deg(a) is degree of vertex a. here, we compute this topological index forsome infinite classes of dendrimer graphs.

The present paper focuses on numerical study for an inclined magneto-hydrodynamic effect on free convection flow of a tangent hyperbolic nanofluid embedded with Carbon nanotubes (CNTs) over a stretching surface taking velocity and thermal slip into account. Two types of nanoparticles are considered for the study; they are single and multi-walled nanotubes. The presentation of single-parameter g...

A careful exposition of Zilber’s quasiminimal excellent classes and their categoricity is given, leading to two new results: the Lω1,ω(Q)definability assumption may be dropped, and each class is determined by its model of dimension א0. Boris Zilber developed quasiminimal excellent classes in [Zil05], in order to prove that his conjectural description of complex exponentiation was categorical. T...

These notes are intended to supplement the lecture slides and existing notes and references on graphs available at our institution (in particular Jeff Erickson’s excellent notes) and else where. I assume that the reader is already familiar with the basics of graphs and their representation via adjacency lists and adjaceny matrices. We will asssume throughout these notes that graphs are represen...

solvable graphs (also known as reachable graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). in this paper, the properties of solvable graphs are investigated, and a new concept in multi agent moti...

Graphs are versatile structures for the representation of many real-world data. Deep Learning on graphs is currently able to solve a wide range problems with excellent results. However, both generation and handling large still remain open challenges. This work aims introduce techniques generating test approach complex problem such as calculation dose distribution in oncological radiotherapy app...