ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Technology
Mathematics
Education
Computing
Research
Economy
Biology
Computing
Social Sciences
Pure sciences
all records (73)

Languages
English
Spanish
Portuguese
German
French
Finnish

Countries
Indonesia
USA
Brazil
Australia
South Africa
Ukraine
Germany
Switzerland
Italy
Chile
all records (76)

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

Filter  
 
34.110  Articles
1 of 3.411 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

Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of G, f (G), is the least n such that any distr... see more

Given graph G(V,E). We use the notion of total k-labeling which is edge irregular. The notion of total edge irregularity strength (tes) of graph G means the minimum integer k used in the edge irregular total k-label... see more

Let G be a finite connected graph of order n. The Gutman index Gut(G) of G is defined as ?{x, y} ? V(G)deg(x)deg(y)d(x, y), where deg(x) is the degree of vertex x ? G and d(x, y) is the distance between vertices x and y in G. A cactus graph is a connected... 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

1 of 3.411 pages  |  10  records  |  more records»