ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Computing
Literature
Research
Social Sciences
Computing
Languages
Pure sciences
all records (75)

Languages
English
Spanish
Portuguese
German
French
Finnish

Countries
Indonesia
USA
Brazil
Ukraine
Australia
Chile
Italy
Spain
Canada
Austria
all records (74)

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

Filter  
 
15.924  Articles
1 of 1.593 pages  |  10  records  |  more records»
Let G be a connected, simple and undirected graph. The assignments {0, 2, …, 2kv} to the vertices and {1, 2, …, ke} to the edges of graph G are called total k-labelings, where k = max{ke, 2kv}. The total&n... see more

A zero-sum flow is an assignment of nonzero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum k-flow if the absolute values of edges are less than k. We recall the zero-sum flow... see more

In this paper we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP(n, 3), where n = 7. We also give some basic results for GP(n, k).

The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular. The mat... see more

Let H be a branched-prism graph, denoted by H = (Cm x P2) ? Kn for odd m, m = 3 and n = 1. This paper considers about the existence of the super (a,d)-edge antimagic total labeling of H, for some positive integer a and some non-negative integer d.

An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of positive integers {1,2,...,q} such that all vertex weights are pairwise distinct, where the vertex weight of a vertex is the sum of the labels of all the edge... see more

For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bijection f from V(G)UE(G) to the set of integers {1,2,...., |V(G)|+|E(G)} with the property that f(u) + f(v) +f(uv) = k for each uv elemen E(G) and for a fixe... see more

This paper addresses the mixed Couette-Poiseuille problem, that is the flow between two parallel plates, in the presence of simultaneous pressure gradient and wall motion. Instead of the wall-normal coordinate y, we use the local shear stress as our prima... see more

A basic eigenvalue bound due to Alon and Boppana holds only for regular graphs. In this paper we give a generalized Alon-Boppana bound for eigenvalues of graphs that are not required to be regular. We show that a graph GG with diameter kk and vertex ... see more

1 of 1.593 pages  |  10  records  |  more records»