In 1856, Hamiltonian introduced the Hamiltonian Graph where a Graph which is covered all the vertices without repetition and end with starting vertex. In this paper I would like to prove that every Complete Graph ‘G’ having n ≥ 5 vertices, such that n is odd. If for all pairs of nonadjacent vertices u, v one has du + dv ≥ n − 2, then G has a Hamiltonian path.

Topics: Graph, Complete Graph, Bipartite Graph Hamiltonian Graph

A Partition Aware Engine framework provides a major increase in compression with respect to all currently known techniques, both on web graphs and on social networks. These improvements make it possible to analyse in main memory significantly larger graphs. Graph partition quality affects the overall performance of parallel graph computation systems. The quality of a graph partition is measured by the balance factor and edge cut ratio. A balanced graph partition with small edge cut ratio is...

Topics: Message Processing, Parallel Graph, Graph Partition, Graph Computation.

7
7.0

Aug 12, 2018
08/18

by
Jure Leskovec; Andrej Krevl

data

#
eye 7

#
favorite 0

#
comment 0

From http://snap.stanford.edu/data/roadNet-TX.html Dataset information This is a road network of Texas. Intersections and endpoints are represented by nodes, and the roads connecting these intersections or endpoints are represented by undirected edges. Dataset statistics Nodes: 1379917 Edges: 1921660 Nodes in largest WCC: 1351137 (0.979) Edges in largest WCC: 1879201 (0.978) Nodes in largest SCC: 1351137 (0.979) Edges in largest SCC: 1879201 (0.978) Average clustering coefficient: 0.0470 Number...

Topic: graph

Source: http://academictorrents.com/details/224c0ec354dbf703a2cabf00bfcb14b420c5cb90

Mathematical Journal of Interdisciplinary Sciences Volume 7 No. 1

Topic: duplication of a vertex by an edge path cycle graph star graph wheel graph helm graph crown graph...

7
7.0

Aug 12, 2018
08/18

by
Jure Leskovec; Andrej Krevl

data

#
eye 7

#
favorite 0

#
comment 0

From http://snap.stanford.edu/data/roadNet-PA.html Dataset information This is a road network of Pennsylvania. Intersections and endpoints are represented by nodes, and the roads connecting these intersections or endpoints are represented by undirected edges. Dataset statistics Nodes: 1088092 Edges: 1541898 Nodes in largest WCC: 1087562 (1.000) Edges in largest WCC: 1541514 (1.000) Nodes in largest SCC: 1087562 (1.000) Edges in largest SCC: 1541514 (1.000) Average clustering coefficient: 0.0465...

Topic: graph

Source: http://academictorrents.com/details/16a16a4fbf5342d644326a6eef258e5499cf8328

Journal of Research of the National Bureau of Standards

Topics: Clique, clique graph, intersection graph, pseudointersection graph, set covering

3
3.0

texts

#
eye 3

#
favorite 0

#
comment 0

75 pages : 30 cm

Topics: Trees (Graph theory), Graph theory

With the growing use of data in all aspects of government and commerce, the need for that data to be both accessible and secure is also growing. One solution to this dual need is provided by Accumulo, a database that allows multiple users of various security levels to access one platform but receive authorization to view only portions of the database. Various databases, however, organize information differently. This thesis examines the possibility of implementing a granular security on a graph...

Topics: database security, graph database, granular security, bipartite graph, directed graph, multi-slice...

Thesis--Illinois

Topics: Graph theory, Trees (Graph theory)

60
60

Dec 3, 2018
12/18

by
Advanced Seminar on Graph Theory and Its Applications (1969 : University of Wisconsin)

texts

#
eye 60

#
favorite 1

#
comment 0

viii, 262 pages : 24 cm

Topics: Graph theory -- Congresses, Graph theory

11
11

Aug 12, 2018
08/18

by
Jure Leskovec; Andrej Krevl

data

#
eye 11

#
favorite 0

#
comment 0

From http://snap.stanford.edu/data/roadNet-CA.html Dataset information A road network of California. Intersections and endpoints are represented by nodes and the roads connecting these intersections or road endpoints are represented by undirected edges. Dataset statistics Nodes: 1965206 Edges: 2766607 Nodes in largest WCC: 1957027 (0.996) Edges in largest WCC: 2760388 (0.998) Nodes in largest SCC: 1957027 (0.996) Edges in largest SCC: 2760388 (0.998) Average clustering coefficient: 0.0464...

Topic: graph

Source: http://academictorrents.com/details/0fa73e4f646b3e3258e7af3e22d651a2cf342de7

14
14

Aug 10, 2020
08/20

by
Center for Accessible Technology in Sign

movies

#
eye 14

#
favorite 0

#
comment 0

ASL vocabulary

Topic: graph

2,347
2.3K

Nov 7, 2004
11/04

by
http://www.padowan.dk

software

#
eye 2,347

#
favorite 0

#
comment 0

This program is for drawing graphs of mathematical functions in a coordinate system. Graphs may be added with different color and line styles. Both standard functions and parameter functions are supported. Evaluate a function at an entered point or trace the function with the mouse. You can also add shadings to functions and series of points to the coordinate system. Trendlines may be added to point series, and you can save the coordinate system and everything on it as an image file. You can...

Topics: Graph, Business, Engineering, Graphs, graph

53
53

Jan 11, 2020
01/20

by
Cambridge Combinatorial Conference (1977 : Trinity College)

texts

#
eye 53

#
favorite 0

#
comment 0

vii, 295 pages : 25 cm

Topics: Graph theory, Graph theory -- Congresses

A graph labeling is a mapping that carries a set of graph elements onto a set of numbers called labels (usually the set of integers). In this paper we prove the existence of graph labeling such as Graceful, odd graceful, even graceful and (k,d) graceful labeling for extended duplicate graph of comb graph by presenting algorithms.

Topics: Graph labeling, Comb graph, Duplicate graphs.

Journal of Research of the National Bureau of Standards

Topics: Cube of a graph, graph, hamiltonian

40
40

Mar 19, 2014
03/14

by
S. Sudha & V. Kanniga

texts

#
eye 40

#
favorite 0

#
comment 0

A k- coloring of a graph G=(V,E) is a mapping c:V (G)→{1,2,3,…} such that uv∈E(G)⇒c(u)≠c(v). In this paper, we have considered a complete bi-partite graph K_(m,n)for all m,n and proved that the star-in-chromatic number of K_(m,n) is either n + 1 if m ≥ n or m + 1 if n > m respectively. We have also found that the star-in-chromatic number of a wheel graph W_n has the lower bound and upper bound as 4 ≤ χ_si (W_n) ≤ 5. Further we...

Topics: Complete Bi-Partite Graph, Wheel Graph, Prism Graph, Star-in-Coloring

The present authors are motivated by two research articles "Divisor Cordial Graphs" by Varatharajan et al. and "Square Divisor Cordial Graphs" by Murugesan et al. We introduce the concept of cube divisor cordial labeling. A cube divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1,2,¼,|V |} such that an edge e = uv is assigned the label 1 if [ f (u)]3 | f (v) or [ f (v)]3 | f (u) and the label 0 otherwise, then | ef (0) - ef (1) |£ 1. A...

Topics: Cube Divisor Cordial Labeling, Complete Graph, Star Graph, Complete Bipartite Graph

In this paper, various fuzzy graphs with regular and totally regular are introduced. Some theorems of regular fuzzy graphs are discussed with their complements and µ-complements. A necessary and sufficient condition under which they are equivalent is provided.

Topics: Strong Fuzzy Graph, Complete Fuzzy Graph, Regular Fuzzy Graph, Totally Regular Fuzzy Graph,...

Journal of Research of the National Bureau of Standards

Topics: graph, hamiltonian, power of a graph

96
96

Sep 3, 2019
09/19

by
McHugh, James A., 1944-

texts

#
eye 96

#
favorite 1

#
comment 0

viii, 327 p. : 25 cm

Topics: Graph theory -- Data processing, Graph theory

4
4.0

Aug 19, 2022
08/22

by
Jensen, Tommy R

texts

#
eye 4

#
favorite 1

#
comment 0

xix, 295 p. : 24 cm

Topic: Graph coloring

491
491

Aug 31, 2019
08/19

by
Chartrand, Gary

texts

#
eye 491

#
favorite 6

#
comment 0

xii, 294 p. : 22 cm

Topic: Graph theory

7
7.0

Aug 11, 2022
08/22

by
Diestel, Reinhard

texts

#
eye 7

#
favorite 0

#
comment 0

xvi, 410 p. : 25 cm

Topic: Graph theory

446
446

Sep 3, 2019
09/19

by
Bondy, J. A., 1944-

texts

#
eye 446

#
favorite 3

#
comment 0

x, 264 p. : 24 cm

Topic: Graph theory

16
16

Jul 25, 2020
07/20

by
Yap, H. P. (Hian Poh), 1938-

texts

#
eye 16

#
favorite 0

#
comment 0

230 p. ; 23 cm

Topic: Graph theory

12
12

Jun 8, 2020
06/20

by
Center for Accessible Technology in Sign

movies

#
eye 12

#
favorite 0

#
comment 0

ASL vocabulary

Topic: bar graph

1
1.0

Aug 27, 2022
08/22

by
Li, Fajie

texts

#
eye 1

#
favorite 0

#
comment 0

xvii, 376 p. : 24 cm

Topic: Graph algorithms

160
160

Sep 4, 2019
09/19

by
Aldous, Joan M., 1938-

texts

#
eye 160

#
favorite 1

#
comment 0

xi, 444 p. : 24 cm. +

Topic: Graph theory

51
51

Jun 10, 2021
06/21

by
Carré, Bernard

texts

#
eye 51

#
favorite 1

#
comment 0

xvi, 277 p. : 23 cm

Topic: Graph theory

6
6.0

Sep 21, 2020
09/20

by
Center for Accessible Technology in Sign

movies

#
eye 6

#
favorite 0

#
comment 0

ASL vocabulary

Topic: parent graph

89
89

Aug 7, 2019
08/19

by
Ore, Øystein, 1899-1968

texts

#
eye 89

#
favorite 1

#
comment 1

v. 27 cm

favoritefavoritefavoritefavoritefavorite ( 1 reviews )

Topic: Graph theory

Graph Theory Bondy Murty 3

Topics: graph, vertex, theorem, vertices, graphs, edge, directed, set, cycle, digraph, simple graph, vertex...

A Graph G with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding n such that the labels of each pair of adjacent vertices are relatively prime. A graph G which admits prime labeling is called a prime graph. In this paper we investigate the existence of prime labeling of some graphs related to cycle Cn, wheel 𝑊𝑛 ,crown 𝐶𝑛 ∗ ,Helm𝐻𝑛and Gear graph𝐺𝑛 ,Star𝑠𝑛 , Friendship graph 𝑇𝑛 ,prism...

Topics: Graph Labeling, Prime Labeling, Duplication, Prime Graph.

Journal of Research of the National Bureau of Standards

Topics: Cayley graph, circulant, cycle decomposition, edge-transitive graph, grouplike set, line-symmetric...

In this paper, we study some classes of graphs and their corresponding labelings.

Topics: Labeling, sequential graph, harmonious graph, prime graph, Smarandache common k-factor labeling

28
28

Sep 4, 2019
09/19

by
Capobianco, Michael

texts

#
eye 28

#
favorite 2

#
comment 0

xii, 259 p. : 24 cm

Topic: Graph theory

316
316

Sep 3, 2019
09/19

by
Brandstädt, Andreas

texts

#
eye 316

#
favorite 0

#
comment 0

xi, 304 p. : 26 cm

Topic: Graph theory

42
42

texts

#
eye 42

#
favorite 1

#
comment 0

xv, 276 p. : 24 cm

Topic: Graph theory

Source: removedNEL

49
49

Sep 4, 2019
09/19

by
Zhang, Cun-Quan, 1952-

texts

#
eye 49

#
favorite 0

#
comment 0

xii, 379 p. : 24 cm

Topic: Graph theory

2
2.0

Aug 12, 2022
08/22

by
Gondran, Michel

texts

#
eye 2

#
favorite 0

#
comment 0

xix, 383 p. : 25 cm

Topics: Graph theory, Semirings (Mathematics), Dioid, Graph, Halbring

"UILU-ENG 77 1715."

Topics: Trees (Graph theory), Decomposition (Mathematics), Graph theory

2
2.0

Nov 8, 2022
11/22

by
Holt, Michael

texts

#
eye 2

#
favorite 2

#
comment 0

33 p. : 21 x 23 cm

Topics: Graph theory -- Juvenile literature, Graph theory, Mathematics

78
78

Dec 6, 2010
12/10

by
Stewart, Melissa

texts

#
eye 78

#
favorite 0

#
comment 0

Includes index

Topic: Graph theory

Thesis (M.S.)--University of Illinois at Urbana-Champaign

Topic: Graph theory

17
17

Oct 29, 2021
10/21

by
Wallis, W. D

texts

#
eye 17

#
favorite 2

#
comment 0

xix, 260 p. : 24 cm

Topic: Graph theory

52
52

Aug 20, 2016
08/16

by
IASET JOURNALS

texts

#
eye 52

#
favorite 0

#
comment 0

In this paper, we introduce the concept ofentire pathos edge semientire block graph of a tree E Pe (T). We obtain some properties of this graph. We study the characterization of graphs whose entire pathos edge semientire block graphs are always planar, minimally nonouter planar, crossing number one. Further, we also establish the characterization for E Pe (T) to be Hamiltonian and noneulerian.

Topics: Block Graph, Edge Semi Entire Graph, Inner Vertex Number, Line Graph

Given a graph G and its vertex set V(G), the chromatic number, Chi(G), represents the minimum number of colors required to color the vertices of G so that no two adjacent vertices have the same color. The domination number of G, gamma(G), the minimum number of vertices in a set S, where every vertex in the set ( ) V G S is adjacent to a vertex in S. The dominator chromatic number of the graph, Chi subd (G) represents the smallest number of colors required in a proper coloring of G with the...

Topic: Graph theory

5
5.0

Oct 6, 2022
10/22

by
Kocay, William

texts

#
eye 5

#
favorite 3

#
comment 0

483 p. : 24 cm

Topic: Graph algorithms

378
378

Sep 3, 2019
09/19

by
Gould, Ronald

texts

#
eye 378

#
favorite 13

#
comment 0

x, 332 p. : 24 cm

Topic: Graph theory