ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Technology
Mathematics
Computing
Literature
Social Sciences
Languages
Architecture and Urbanism
Computing
Research
all records (75)

Languages
English
Spanish
German
Portuguese
French
Finnish

Countries
Indonesia
USA
Ukraine
Australia
Brazil
South Africa
Chile
Canada
Italy
Austria
all records (75)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
17.905  Articles
1 of 1.791 pages  |  10  records  |  more records»
We develop a new framework for analysing finite connected, oriented graphs of valency four, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of `basic' graphs such that ea... see more

Simultaneous mass production of high quality vertically oriented graphene nanostructures and doping them by using an inductively coupled plasma chemical vapor deposition (ICP CVD) is a technological problem because little is understood about their growth ... see more

An oriented k - coloring of an oriented graph G? is a partition of V(G?) into k color classes such that no two adjacent vertices belong to the same color class, and all the arcs linking the two color classes have the same direction. The oriented chromatic... see more

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map is counted wit... see more

Molecular dynamics simulations are carried out to investigate the structure and capacitance of the electrical double layers (EDLs) at the interface of vertically oriented graphene and ionic liquids [EMIM]+/[BF4]-. The distribution and migration of the ion... see more

In this article, we define a function that counts the number of (onto) homomorphisms of an oriented graph. We show that this function is always a polynomial and establish it as an extension of the notion of chromatic polynomials. We study algebraic proper... see more

Let GG be an nn-vertex oriented graph. Let t(G)t(G) (respectively i(G)i(G)) be the probability that a random set of 33 vertices of GG spans a transitive triangle (respectively an independent set). We prove that t(G)+i(G)=19-on(1)t(G) + i(G) \geq \frac{1}{... see more

Oriented matroids are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a key  role in combinatorics, computat... see more

Let D\mathcal{D} be a weighted oriented graph and I(D)I(\mathcal{D}) be its edge ideal. In this paper, we investigate the Betti numbers of I(D)I(\mathcal{D}) via upper-Koszul simplicial complexes, Betti splittings and the mapping cone construction. In par... see more

1 of 1.791 pages  |  10  records  |  more records»