• No results found

grid graphs

Total Dominator Chromatic Number of Grid Graphs

Total Dominator Chromatic Number of Grid Graphs

... Let G be a graph with minimum degree at least one. A total dominator coloring of G is a proper coloring of G with the extra property that every vertex in G properly dominates a color class. The total dominator chromatic ...

8

Word-representability of face subdivisions of triangular grid graphs

Word-representability of face subdivisions of triangular grid graphs

... triangular grid) is the Archimedean tiling 3 6 introduced in [13] and ...triangular grid graph G in this paper we mean a graph obtained from T ∞ as ...triangular grid graph is 3-colorable, and thus ...

17

An optimization algorithm based on grid-graphs for minimizing interconnect delay in VLSI layout design

An optimization algorithm based on grid-graphs for minimizing interconnect delay in VLSI layout design

... ABSTRACT— In this paper, we describe a routing optimization algorithm based on grid-graphs for application in a deep-submicron VLSI layout design. The proposed algorithm, named S-RABILA (for Simultaneous ...

15

On the 2 Domination Number of Complete Grid Graphs

On the 2 Domination Number of Complete Grid Graphs

... plication to Algorithms and Computer Science. John Wiley and Sons, New York, 282-300. [3] Fink, J.F. and Jacobson, M.S. (1985) On n-Domination, n-Dependence and Forbidden Sub- graphs. In: Graph Theory with ...

19

The Longest ( st )-paths of C-shaped Supergrid Graphs

The Longest ( st )-paths of C-shaped Supergrid Graphs

... rectangular grid graphs and presented a parallel algorithm for the Hamilto- nian path problem with two given endpoints in rectangular grid ...solid grid graphs [31]. In [36], Salman ...

7

Bragg Diffraction Patterns as Graph Characteristics

Bragg Diffraction Patterns as Graph Characteristics

... what frequencies (energies in the power spectra) can be seen in the diffraction pattern. For instance, in circle (ring) graphs Fig. 2 (top-left) shows that the energy distribution may be constrained to lie at 0 = ...

15

The Hamiltonicity and Hamiltonian Connectivity of -shaped Supergrid Graphs

The Hamiltonicity and Hamiltonian Connectivity of -shaped Supergrid Graphs

... triangular grid graphs except one special case contain Hamiltonian ...triangular grid graphs has been shown to be NP-complete ...triangular grid graphs (with one exception) ...

6

Word-representability of triangulations of grid-covered cylinder graphs

Word-representability of triangulations of grid-covered cylinder graphs

... of grid-covered cylinder graphs, which is a cyclic version of rect- angular grid graphs; see Subsection ...the graphs in question with chromatic number 4 are actu- ally ...

19

Interval Edge Coloring of Sudha Grid of Hexagons, Gear and Helm Graphs

Interval Edge Coloring of Sudha Grid of Hexagons, Gear and Helm Graphs

... complete graphs and dimensional ...bipartite graphs and ...Sudha grid graphs was introduced by Sudha et ...related graphs and Meena et ...Sudha grid of hexagons (, ) , gear graph ...

10

On the metric dimension of 
		silicate stars

On the metric dimension of silicate stars

... for grid graphs was studied by Melter and Tomescu ...dimensional grid graph is d ...and grid graphs [13], Petersen graphs [19], honeycomb networks, Hexagonal networks [4], Torus ...

6

On covers of graphs by Cayley graphs

On covers of graphs by Cayley graphs

... second copy that is at the same ‘height’, i.e. has the same first coordinate (and so x obtains k new neighbours in the other copy). Easily, G is a Cayley graph. Let H be a toroidal grid of ‘length’ l and ‘width’ k ...

10

On Eccentric Graphs of Broom Graphs

On Eccentric Graphs of Broom Graphs

... of graphs with very many interesting ...of graphs is the class of broom graphs (see for example [4, 6, 8, 9]) which are in fact one of the types of chemical trees ...eccentric graphs are ...

7

The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth

The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth

... The embedding of complete bipartite graphs onto grids with a The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth.. minimum grid cutwidth.[r] ...

73

Certain Classes of Fuzzy Graphs

Certain Classes of Fuzzy Graphs

... The operations of joining electrical components in parallel and in series are very impor- tant in electrical network theory. Graphs may be also constructed through an operation known as the parallel connection. ...

9

Degree Splitting of Root Square Mean Graphs

Degree Splitting of Root Square Mean Graphs

... The graphs considered here are simple, finite and undirected. Let V G ( ) denote the vertex set and E G ( ) de- note the edge set of G. For detailed survey of graph labeling we refer to Gallian [1]. For all other ...

13

The Neighborhood Graph of a Graph

The Neighborhood Graph of a Graph

... for graphs G such that N(G) = G. Also characterizations are given for graphs (i) whose neighborhood graphs are connected (ii) whose neighborhood graphs are r-regular, (iii) whose neighborhood ...

8

The matching energy of graphs with given edge connectivity

The matching energy of graphs with given edge connectivity

... extremal graphs of the matching energy in unicyclic, bicyclic graphs with a given diameter, ...unicyclic graphs with fixed girth and the graphs with given clique ...in graphs with given ...

9

A Comparison on Metric Dimension of Graphs, Line Graphs, and Line Graphs of the Subdivision Graphs

A Comparison on Metric Dimension of Graphs, Line Graphs, and Line Graphs of the Subdivision Graphs

... para-line graphs; we also compare metric dimension of graphs, line graphs, and para-line ...para-line graphs for some classes of graphs; further, we give an example of a graph G such ...

15

New results on word-representable graphs

New results on word-representable graphs

... word-representable graphs were obtained in the literature [8, 9, 11, 12, ...these graphs is still very limited and many important questions remain ...word-representable graphs on n vertices are ...

8

Some Forbidden Subgraphs of Trees Being Opposition Graphs

Some Forbidden Subgraphs of Trees Being Opposition Graphs

... perfect graphs. For example, it mentions the relations between opposition graphs and threshold graphs, and the relations between opposition graphs and perfect ...orderable graphs [4, 5, ...

6

Show all 9689 documents...

Related subjects