ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Technology
Mathematics
Computing
Research
Biology
Architecture and Urbanism
Pure sciences
Social Sciences
Computing
all records (74)

Languages
English
Spanish
Portuguese
German
French
Finnish

Countries
Indonesia
USA
Australia
Brazil
Ukraine
Chile
Italy
South Africa
Spain
Switzerland
all records (77)

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

Filter  
 
24.916  Articles
1 of 2.493 pages  |  10  records  |  more records»
Suppose G=(V,E) is a graph with the vertex set V(G) and edge set E(G) we defined a labeling f:V?E?{1,2,…,k} to be an edge irregular total k-labeling of graph G if for every two different edge e and f there is wt(e)?wt(f). The minimum k for which the graph... see more

A zonal labeling of a plane graph G is an assignment of the two nonzero elements of the ring Z3 of integers modulo 3 to the vertices of G such that the sum of the labels of the vertices on the boundary of each regio... see more

An extremal graph for a graph HH on nn vertices is a graph on nn vertices with maximum number of edges that does not contain HH as a subgraph. Let Tn,rT_{n,r} be the Turán graph, which is the complete rr-partite graph on nn vertices with part sizes that d... see more

The edge-distinguishing chromatic number (EDCN) of a graph G is the minimum positive integer k such that there exists a vertex coloring c : V(G)?{1, 2, …, k} whose induced edge labels {c(u),c(v)} are distinct for al... see more

In this paper, we first coin a new graph theoretic problem called the diameter cycle problem with numerous applications. A longest cycle in a graph G = (V, E) is referred to as a diameter cycle of G iff the distance in G of every vertex on ... see more

Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...,ke} ... see more

?We will classify all finite simple graphs whose 2-distance graph have large or small maximum valency?, ?specially when it is a path or a cycle?.

In discrete mathematics, there are many problems that belong to the NP class of complexity. The solution of these problems has both theoretical and practical value. One of them is the problem of finding a Hamiltonian cycle on a graph. The aim of the work ... see more

Farrell introduced the general class of graph polynomials which he called the family polynomials, or F-polynomials, of graphs. One of these is the cycle, or circuit, polynomial. This polynomial is in turn a common generalization of the characteristic, per... see more

1 of 2.493 pages  |  10  records  |  more records»