scholarly journals On irregular colorings of double wheel graph families

2018 ◽  
Vol 68 (1) ◽  
pp. 944-949
Author(s):  
A. Rohini ◽  
M. Venkatachalam
Keyword(s):  
Wheel Graph ◽  
Graph Families

scholarly journals Boundary Domination of Line and Middle Graph of Wheel Graph Families

2016 ◽  
Vol 134 (5) ◽  
pp. 1-5 ◽  
Author(s):  
Mohammed Alatif ◽  
Puttaswamy Rangaiah ◽  
Nayaka S.R.
Keyword(s):  
Wheel Graph ◽  
Middle Graph ◽  
Graph Families

scholarly journals Star edge coloring of corona product of path and wheel graph families

2018 ◽  
Vol 37 (4) ◽  
pp. 593-601 ◽  
Author(s):  
K. Kaliraj ◽  
R. Sivakami ◽  
Vivin J. Vernold
Keyword(s):  
Edge Coloring ◽  
Wheel Graph ◽  
Graph Families ◽  
Corona Product

scholarly journals Extremal graphs with respect to vertex betweenness centrality for certain graph families

Filomat ◽  
2016 ◽  
Vol 30 (11) ◽  
pp. 3123-3130
Author(s):  
Jelena Klisara ◽  
Jana Hurajová ◽  
Tomás Madaras ◽  
Riste Skrekovski
Keyword(s):  
Betweenness Centrality ◽  
Maximum Degree ◽  
Minimum Degree ◽  
Shortest Paths ◽  
Extremal Graphs ◽  
Wheel Graph ◽  
Graph Families ◽  
Pass Through ◽  
Fan Graph ◽  
Extremal Values

The betweenness centrality of a vertex in a graph is the sum of relative numbers of shortest paths that pass through that vertex. We study extremal values of vertex betweenness within various families of graphs. We prove that, in the family of 2-connected (resp. 3-connected) graphs on n vertices, the maximum betweenness value is reached for the maximum degree vertex of the fan graph F1,n-1 (resp. the wheel graph Wn); the maximum betweenness values, their realizing vertices and extremal graphs are determined also for wider families of graphs of minimum degree at least 2 or 3, respectively, and, in addition, for graphs with prescribed maximum degree or prescribed diameter at least 3.

scholarly journals The simultaneous metric dimension of graph families

2016 ◽  
Vol 198 ◽  
pp. 241-250 ◽  
Author(s):  
Yunior Ramírez-Cruz ◽  
Ortrud R. Oellermann ◽  
Juan A. Rodríguez-Velázquez
Keyword(s):  
Metric Dimension ◽  
Graph Families ◽  
Simultaneous Metric Dimension

scholarly journals p-box: a new graph model

2015 ◽  
Vol Vol. 17 no. 1 (Graph Theory) ◽  
Author(s):  
Mauricio Soto ◽  
Christopher Thraves-Caro
Keyword(s):  
Graph Theory ◽  
Graph Model ◽  
Directed Path ◽  
Outerplanar Graphs ◽  
New Model ◽  
Model Based ◽  
Representative Element ◽  
International Audience ◽  
Graph Families

Graph Theory International audience In this document, we study the scope of the following graph model: each vertex is assigned to a box in ℝd and to a representative element that belongs to that box. Two vertices are connected by an edge if and only if its respective boxes contain the opposite representative element. We focus our study on the case where boxes (and therefore representative elements) associated to vertices are spread in ℝ. We give both, a combinatorial and an intersection characterization of the model. Based on these characterizations, we determine graph families that contain the model (e. g., boxicity 2 graphs) and others that the new model contains (e. g., rooted directed path). We also study the particular case where each representative element is the center of its respective box. In this particular case, we provide constructive representations for interval, block and outerplanar graphs. Finally, we show that the general and the particular model are not equivalent by constructing a graph family that separates the two cases.

scholarly journals Classes of graphs with restricted interval models

1999 ◽  
Vol Vol. 3 no. 4 ◽  
Author(s):  
Andrzej Proskurowski ◽  
Jan Arne Telle
Keyword(s):  
Maximum Clique ◽  
Interval Graphs ◽  
Induced Subgraph ◽  
Graph Theoretic ◽  
Graph Classes ◽  
International Audience ◽  
Forbidden Induced Subgraph ◽  
Nested Hierarchy ◽  
Graph Families

International audience We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs. We initiate a graph-theoretic study of subgraphs of q-proper interval graphs with maximum clique size k+1 and give an equivalent characterization of these graphs by restricted path-decomposition. By allowing the parameter q to vary from 0 to k, we obtain a nested hierarchy of graph families, from graphs of bandwidth at most k to graphs of pathwidth at most k. Allowing both parameters to vary, we have an infinite lattice of graph classes ordered by containment.

Sign in / Sign up

Export Citation Format

Share Document