Log in

Relevant bibliographies by topics / Grid graph / Journal articles

To see the other types of publications on this topic, follow the link: Grid graph.

Journal articles on the topic 'Grid graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 20 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Grid graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

V J Kaneria, H P Chudasama, and P P Andharia. "Absolute Mean Graceful Labeling in Path Union of Various Graphs." Mathematical Journal of Interdisciplinary Sciences 7, no. 1 (2018): 51–56. http://dx.doi.org/10.15415/mjis.2018.71008.

Full text

Abstract:

Present paper aims to focus on absolute mean graceful labeling in path union of various graphs. We proved path union of graphs like tree, path Pn, cycle Cn, complete bipartite graph Km, n, grid graph PM × Pn, step grid graph Stn and double step grid graph DStn are absolute mean graceful graphs.

APA, Harvard, Vancouver, ISO, and other styles

2

Zamfirescu, Christina, and Tudor Zamfirescu. "Hamiltonicity of Topological Grid Graphs." JUCS - Journal of Universal Computer Science 13, no. (11) (2007): 1791–800. https://doi.org/10.3217/jucs-013-11-1791.

Full text

Abstract:

In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of the usual square lattice graph of the plane. The main results are as follows. The shortness coefficient of the family of all topological grid graphs is at most 16/17. Every 3-connected topological grid graph is hamiltonian.

APA, Harvard, Vancouver, ISO, and other styles

3

Kor, Yashar, Liang Tan, Petr Musilek, and Marek Z. Reformat. "Integrating Knowledge Graphs into Distribution Grid Decision Support Systems." Future Internet 16, no. 1 (2023): 2. http://dx.doi.org/10.3390/fi16010002.

Full text

Abstract:

Distribution grids are complex networks containing multiple pieces of equipment. These components are interconnected, and each of them is described by various attributes. A knowledge graph is an interesting data format that represents pieces of information as nodes and relations between the pieces as edges. In this paper, we describe the proposed vocabulary used to build a distribution system knowledge graph. We identify the concepts used in such graphs and a set of relations to represent links between concepts. Both provide a semantically rich representation of a system. Additionally, we offe

APA, Harvard, Vancouver, ISO, and other styles

4

Hutson, Kevin R., and Stephen T. Hedetniemi. "Efficient Domination in Grid Graphs." Journal of Combinatorial Mathematics and Combinatorial Computing 122, no. 1 (2024): 325–42. http://dx.doi.org/10.61091/jcmcc122-27.

Full text

Abstract:

Let G = ( V , E ) be a graph. A subset S ⊆ V of vertices is an \textit{efficient dominating set} if every vertex v ∈ V is adjacent to exactly one vertex in S , where a vertex u ∈ S is considered to be adjacent to itself. Efficient domination is highly desirable in many real-world applications, and yet, in general, graphs are often not efficient. It is of value, therefore, to determine optimum ways in which inefficient graphs can be changed in order to make them efficient. It is well known, for example, that almost no m × n grid graphs have efficient dominating sets. In this paper, we consider

APA, Harvard, Vancouver, ISO, and other styles

5

Cyman, Joanna, and Joanna Raczek. "Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids." Energies 15, no. 9 (2022): 2969. http://dx.doi.org/10.3390/en15092969.

Full text

Abstract:

Smart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost. In this paper, we study a two-dimensional rectangular grid graph which is considered to be a model of a smart grid; nodes of the graph represent points and devices of

APA, Harvard, Vancouver, ISO, and other styles

6

Smirnov, Alexander Valeryevich. "Two-Step Colouring of Grid Graphs of Different Types." Modeling and Analysis of Information Systems 29, no. 3 (2022): 166–80. http://dx.doi.org/10.18255/1818-1015-2022-3-166-180.

Full text

Abstract:

In this article, we consider the NP-hard problem of the two-step colouring of a graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or 2 between each other. The optimum two-step colouring is one that uses the minimum possible number of colours.The two-step colouring problem is studied in application to grid graphs. We consider four types of grids: triangular, square, hexagonal, and octogonal. We show that the optimum two-step colouring of hexagonal and octogonal grid graphs requi

APA, Harvard, Vancouver, ISO, and other styles

7

Kaneria, V. J., H. M. Makadia, and R. V. Viradia. "Graceful Labeling for Disconnected Grid Related Graphs." Bulletin of Mathematical Sciences and Applications 11 (February 2015): 6–11. http://dx.doi.org/10.18052/www.scipress.com/bmsa.11.6.

Full text

Abstract:

In this paper we have proved that union of three grid graphs, U3l=1(Pnl×Pml)and union of finite copies of a grid graph (Pn×Pm)are graceful. We have also given two graceful labeling functions to the grid graph (Pn×Pm).

APA, Harvard, Vancouver, ISO, and other styles

8

W., K. M. Indunil, N. Kaluarachchi K., and C. G. Perera A. "k - Odd Prime Labeling of m×n Grid Graphs." Iconic Research and Engineering Journals 6, no. 6 (2022): 7. https://doi.org/10.5281/zenodo.7439763.

Full text

Abstract:

Graph labeling can be mentioned as one of the most prominent research areas in graph theory and the history of graph labeling can be traced back to the 1960s as well. There is a  quite number of graph labeling techniques such as graceful labeling, radio labeling, antimagic labeling, prime labeling, and lucky labeling. There are various subtypes of prime labeling including odd prime labeling, k- prime labeling, neighborhood prime labeling, and coprime labeling. In this study, we explore one of the prime labeling varieties called odd prime labeling. There is a well-known conjecture related

APA, Harvard, Vancouver, ISO, and other styles

9

Dr., Hamzeh Mujahed, and Benedek Nagy Dr. "Exact Formula Computing the Wiener Index on Rows of Unit Cells of the Diamond Cubic Grid Connected in a Row." Palestinian Journal of Technology and Applied Sciences (PJTA) 2, no. 1 (2019): 69–81. https://doi.org/10.5281/zenodo.2576339.

Full text

Abstract:

The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a graph invariant much studied in both mathematical and chemical literature.Topological graph indices are introduced as mathematical tools for molecule descriptions. Recently, they were computed not only for graphs representing molecules, but for other regular structured graphs including some 2 and 3 dimensional structures. The Carbon atoms in the diamond are arranged in a well defined structure. In this paper, the graph of this structure is analysed, especially, the connected part of a sequence of un

APA, Harvard, Vancouver, ISO, and other styles

10

Dr., Hamzeh Mujahed, and Benedek Nagy Dr. "Exact Formula Computing the Wiener Index on Rows of Unit Cells of the Diamond Cubic Grid Connected in a Row." Palestinian Journal of Technology & Applied Sciences (PJTA), no. 2 (March 4, 2019): 69–81. https://doi.org/10.5281/zenodo.2582919.

Full text

Abstract:

The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a graph invariant much studied in both mathematical and chemical literature.Topological graph indices are introduced as mathematical tools for molecule descriptions. Recently, they were computed not only for graphs representing molecules, but for other regular structured graphs including some 2 and 3 dimensional structures. The Carbon atoms in the diamond are arranged in a well defined structure. In this paper, the graph of this structure is analysed, especially, the connected part of a sequence of un

APA, Harvard, Vancouver, ISO, and other styles

11

Haspika, Haspika, Hasmawati Hasmawati, and Naimah Aris. "The Partition Dimension on the Grid Graph." Jurnal Matematika, Statistika dan Komputasi 19, no. 2 (2023): 351–58. http://dx.doi.org/10.20956/j.v19i2.23904.

Full text

Abstract:

Graph G is a discrete set pair with the notation V(G) with its element called a vertex and the set of different and unordered pairs with the notation E(G) where the element is called edge. One type of graph Gm,n is a grid graph that is notated is a graph of the result of the operation between two path graphs (Pm*Pn). The set of partition∏ ={S1,S2,…,Sk} of V(G) is called a resolving partition if its representation for each vertex on graph G is different. The cardinality of the minimum resolving partition of graph G is the partition dimension of the graph G denoted pd(G). This paper discusses th

APA, Harvard, Vancouver, ISO, and other styles

12

Zhou, Wenke, Guo Chen, Hongzhi Deng, and Jianhua Tu. "Enumeration of dissociation sets in grid graphs." AIMS Mathematics 9, no. 6 (2024): 14899–912. http://dx.doi.org/10.3934/math.2024721.

Full text

Abstract:

<abstract><p>A dissociation set of a graph $ G $ refers to a set of vertices inducing a subgraph with maximum degree at most 1 and serves as a generalization of two fundamental concepts in graph theory: Independent sets and induced matchings. The enumeration of specific substructures in grid graphs has been a captivating area of research in graph theory. Over the past few decades, the enumeration problems related to various structures in grid graphs such as Hamiltonian cycles, Hamiltonian paths, independent sets, maximal independent sets, and dominating sets have been deeply studie

APA, Harvard, Vancouver, ISO, and other styles

13

XIAO, TIANHANG, and HAISONG ANG. "COMBINATION OF MESH DEFORMATION AND OVERSET GRID FOR SIMULATING UNSTEADY FLOW OF INSECT FLIGHT." Modern Physics Letters B 23, no. 03 (2009): 525–28. http://dx.doi.org/10.1142/s0217984909018813.

Full text

Abstract:

As numerical simulation of unsteady flows due to moving boundaries such as flexible flapping-wings is difficult by conventional approaches, an effective strategy which combines mesh deformation based on Delaunay graph mapping and unstructured overset grids is proposed in this paper. A Delaunay graph is generated for each body-fitted grid cluster which overlaps or is embedded within an off-body background grid cluster. At each time step, the graph moves according to the wing's motion and deformation, and the grids move to new positions according to a one-to-one mapping between the graph and the

APA, Harvard, Vancouver, ISO, and other styles

14

Rochanakul, Penying, Hatairat Yingtaweesittikul, and Sayan Panma. "Formulas for the Number of Weak Homomorphisms from Paths to Rectangular Grid Graphs." Symmetry 17, no. 4 (2025): 497. https://doi.org/10.3390/sym17040497.

Full text

Abstract:

A weak homomorphism from graph G to graph H is a mapping f:V(G)→V(H), where either f(x)=f(y) or {f(x),f(y)}∈E(H) hold for all {x,y}∈E(G). A rectangular grid graph is formed by taking the Cartesian product of two paths. Counting weak homomorphisms is a fundamental problem in graph theory. In this paper, we present formulas for calculating the number of weak homomorphisms from paths to rectangular grid graphs. This count directly corresponds to the number of partial walks with length m within the rectangular grid graph, offering a combinatorial solution to this enumeration problem.

APA, Harvard, Vancouver, ISO, and other styles

15

Kaiiali, Mustafa, Rajeev Wankar, C. R. Rao, Arun Agarwal, and Rajkumar Buyya. "Grid Authorization Graph." Future Generation Computer Systems 29, no. 8 (2013): 1909–18. http://dx.doi.org/10.1016/j.future.2013.04.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Uras, Tansel, and Sven Koenig. "Speeding-Up Any-Angle Path-Planning on Grids." Proceedings of the International Conference on Automated Planning and Scheduling 25 (April 8, 2015): 234–38. http://dx.doi.org/10.1609/icaps.v25i1.13724.

Full text

Abstract:

Simple Subgoal Graphs are constructed from grids by placing subgoals at the corners of obstacles and connecting them. They are analogous to visibility graphs for continuous terrain but have fewer edges and can be used to quickly find shortest paths on grids. The vertices of a Simple Subgoal Graph can be partitioned into different levels to create N-Level Subgoal Graphs, which can be used to find shortest paths on grids even more quickly by ignoring subgoals that are not relevant for the search, which significantly reduces the size of the graph being searched. Search using Two-Level Subgoal Gra

APA, Harvard, Vancouver, ISO, and other styles

17

Coté, Ben, and Leanne Merrill. "Multigraphs from crossword puzzle grid designs." Recreational Mathematics Magazine 10, no. 17 (2024): 1–16. http://dx.doi.org/10.2478/rmm-2024-0008.

Full text

Abstract:

Abstract Crossword puzzles lend themselves to mathematical inquiry. Several authors have already described the arrangement of crossword grids and associated combinatorics of answer numbers [Fer14] [Fer20] [McS16]. In this paper, we present a new graph-theoretic representation of crossword puzzle grid designs and describe the mathematical conditions placed on these graphs by well-known crossword construction conventions.

APA, Harvard, Vancouver, ISO, and other styles

18

Fei, Shuyu, Xiong Wan, Haiwei Wu, Xin Shan, Haibao Zhai, and Hongmin Gao. "A Power Grid Topological Error Identification Method Based on Knowledge Graphs and Graph Convolutional Networks." Electronics 13, no. 19 (2024): 3837. http://dx.doi.org/10.3390/electronics13193837.

Full text

Abstract:

Precise and comprehensive model development is essential for predicting power network balance and maintaining power system analysis and optimization. The development of big data technologies and measurement systems has introduced new challenges in power grid modeling, simulation, and fault prediction. In-depth analysis of grid data has become vital for maintaining steady and safe operations. Traditional knowledge graphs can structure data in graph form, but identifying topological errors remains a challenge. Meanwhile, Graph Convolutional Networks (GCNs) can be trained on graph data to detect

APA, Harvard, Vancouver, ISO, and other styles

19

MIURA, KAZUYUKI, SHIN-ICHI NAKANO, and TAKAO NISHIZEKI. "CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS." International Journal of Foundations of Computer Science 17, no. 05 (2006): 1031–60. http://dx.doi.org/10.1142/s012905410600425x.

Full text

Abstract:

A convex grid drawing of a plane graph G is a drawing of G on the plane such that all vertices of G are put on grid points, all edges are drawn as straight-line segments without any edge-intersection, and every face boundary is a convex polygon. In this paper we give a linear-time algorithm for finding a convex grid drawing of every 4-connected plane graph G with four or more vertices on the outer face. The size of the drawing satisfies W + H ≤ n - 1, where n is the number of vertices of G, W is the width and H is the height of the grid drawing. Thus the area W · H is at most ⌈(n - 1)/2⌉ · ⌊(n

APA, Harvard, Vancouver, ISO, and other styles

20

Uras, Tansel, and Sven Koenig. "Feasibility Study: Subgoal Graphs on State Lattices." Proceedings of the International Symposium on Combinatorial Search 8, no. 1 (2021): 100–108. http://dx.doi.org/10.1609/socs.v8i1.18434.

Full text

Abstract:

Search using subgoal graphs is a recent preprocessing-based path-planning algorithm that can find shortest paths on 8-neighbor grids several orders of magnitude faster than A*, while requiring little preprocessing time and memory overhead. In this paper, we first generalize the ideas behind subgoal graphs to a framework that can be specialized to different types of environments (represented as weighted directed graphs) through the choice of a reachability relation. Intuitively, a reachability relation identifies pairs of vertices for which a shortest path can be found quickly. A subgoal graph

APA, Harvard, Vancouver, ISO, and other styles

21

Chaluvaraju, B., and C. Appajigowda. "On Neighbor chromatic number of grid and torus graphs." General Mathematics 27, no. 1 (2019): 3–15. http://dx.doi.org/10.2478/gm-2019-0001.

Full text

Abstract:

Abstract A set S ⊆ V is a neighborhood set of a graph G = (V, E), if G = ∪v∈S 〈 N[v] 〉, where 〈 N[v] 〉 is the subgraph of a graph G induced by v and all vertices adjacent to v. A neighborhood set S is said to be a neighbor coloring set if it contains at least one vertex from each color class of a graph G, where color class of a colored graph is the set of vertices having one particular color. The neighbor chromatic number χn (G) is the minimum cardinality of a neighbor coloring set of a graph G. In this article, some results on neighbor chromatic number of Cartesian products of two paths (grid

APA, Harvard, Vancouver, ISO, and other styles

22

Ramakrishna, Raksha, and Anna Scaglione. "Grid-Graph Signal Processing (Grid-GSP): A Graph Signal Processing Framework for the Power Grid." IEEE Transactions on Signal Processing 69 (2021): 2725–39. http://dx.doi.org/10.1109/tsp.2021.3075145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

P., Sumathi, and Geetha Ramani G. "ARITHMETIC SEQUENTIAL GRACEFUL LABELING ON STEP GRID GRAPH." International Journal of Mathematics and Computer Research 12, no. 07 (2024): 4346–53. https://doi.org/10.5281/zenodo.12749031.

Full text

Abstract:

Let G be a simple, finite, connected, undirected, non-trivial graph with  vertices and  edges.  be the vertex set and  be the edge set of  Let  where a  and  is an injective function. If for each edge   defined by  is a bijective function then the function  is called arithmetic sequential graceful labeling. The graph with arithmetic sequential graceful labeling is called arithmetic sequential graceful graph. In this paper, arithmetic sequential graceful labeling for some special graphs were studied.

APA, Harvard, Vancouver, ISO, and other styles

24

TAMASSIA, ROBERTO, IOANNIS G. TOLLIS, and JEFFREY SCOTT VITTER. "A Parallel Algorithm for Planar Orthogonal Grid Drawings." Parallel Processing Letters 10, no. 01 (2000): 141–50. http://dx.doi.org/10.1142/s0129626400000147.

Full text

Abstract:

In this paper we consider the problem of constructing planar orthogonal grid drawings (or more simply, layouts) of graphs, with the goal of minimizing the number of bends along the edges. We present optimal parallel algorithms that construct graph layouts with O(n) maximum edge length, O(n2) area, and at most 2n+4 bends (for biconnected graphs) and 2.4n+2 bends (for simply connected graphs). All three of these quality measures for the layouts are optimal in the worst case for biconnected graphs. The algorithm runs on a CREW PRAM in O( log n) time with n/ log n processors, thus achieving optima

APA, Harvard, Vancouver, ISO, and other styles

25

Sapunov, Sergiy. "Experiments on Recognition of Infinite Grid Graph Labelling." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 35 (October 25, 2021): 67–78. http://dx.doi.org/10.37069/1683-4720-2021-35-6.

Full text

Abstract:

In recent years, topics related to automaton analysis of geometric environment have attracted widespread attention. The interaction of an automaton and an environment is often represented as a process of an automaton walks along a graph (labyrinth) of environment. Treating environment as vertex-labelled graph was suggested as one approach to addressing the problem of automaton analysis of environment properties. Research in this regard received a wide range of applications, for example, in the problems of image analysis and navigation of mobile robots. This paper considers a four-way infinite

APA, Harvard, Vancouver, ISO, and other styles

26

Li, Fengying, Enyi Yang, Anqiao Ma, and Rongsheng Dong. "Optimal Representation of Large-Scale Graph Data Based on Grid Clustering and K2-Tree." Mathematical Problems in Engineering 2020 (January 22, 2020): 1–8. http://dx.doi.org/10.1155/2020/2354875.

Full text

Abstract:

The application of appropriate graph data compression technology to store and manipulate graph data with tens of thousands of nodes and edges is a prerequisite for analyzing large-scale graph data. The traditional K2-tree representation scheme mechanically partitions the adjacency matrix, which causes the dense interval to be split, resulting in additional storage overhead. As the size of the graph data increases, the query time of K2-tree continues to increase. In view of the above problems, we propose a compact representation scheme for graph data based on grid clustering and K2-tree. Firstl

APA, Harvard, Vancouver, ISO, and other styles

27

De Ita Luna, Guillermo, Mireya Tovar Vidal, and Maria Beatriz Bernábe-Loranca. "A Novel Method for Counting Independent Sets in a Grid Graph." International Journal of Combinatorial Optimization Problems and Informatics 14, no. 1 (2023): 11–18. https://doi.org/10.61467/2007.1558.2023.v14i1.334.

Full text

Abstract:

The problem of counting independent sets of a graph G is not only mathematically relevant and interesting, but also has many applications in physics, mathematics, and theoretical computer science. In this paper, a novel method for counting independent sets on grid-like structures is presented. It starts by explaining the recurrences used by the method to count independent sets on basic topologies of graphs. The method is extended to process grid-like structures of quadratic faces. The proposal has a lower time complexity than the required on the leading and current method based on the transfer

APA, Harvard, Vancouver, ISO, and other styles

28

Iqbal Hossain, Md, and Md Saidur Rahman. "Straight-line monotone grid drawings of series–parallel graphs." Discrete Mathematics, Algorithms and Applications 07, no. 02 (2015): 1550007. http://dx.doi.org/10.1142/s179383091550007x.

Full text

Abstract:

A monotone drawing of a planar graph G is a planar straight-line drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of graphs have been discovered as a new standard for visualizing graphs. In this paper we study monotone drawings of series–parallel graphs in a variable embedding setting. We show that a series–parallel graph of n vertices has a straight-line planar monotone drawing on a grid of size O(n) × O(n2) and such a drawing can be found in linear time.

APA, Harvard, Vancouver, ISO, and other styles

29

Nayaka, S. R., Puttaswamy, and S. Purushothama. "PENDANT DOMINATION IN GRID GRAPHS." Journal of Applied Mathematics and Statistical Analysis 3, no. 3 (2022): 1–8. https://doi.org/10.5281/zenodo.7269675.

Full text

Abstract:

<em>Let </em> <em> be a simple, finite and undirected graph. The set </em> <em> of </em> <em> is called a dominating set of </em> <em> if each vertex not in </em> <em> is adjacent to minimum one vertex in</em> <em>. The least cardinality of a dominating set is known as domination number, indicated by</em> <em>. A dominating set </em> <em> in </em> <em> is called a pendant dominating set if induced sub-graph of </em> <em> contains at least one pendant vertex. The least cardinality of a pendant dominating set is known as the pendant domination number, indi

APA, Harvard, Vancouver, ISO, and other styles

30

Qian, Shu, and Samiha Rao. "Finding the Cheapest Way to Build a Graph." Mathematics Exchange 18, no. 1 (2025): 26–50. https://doi.org/10.33043/92ra679d.

Full text

Abstract:

The Concept Reinforcement Problem is a graph optimization problem introduced by Novikoff. One seeks to build a graph G vertex by vertex in the cheapest way possible for that graph. The cost function for each vertex is a positive, decreasing, convex function where the input is determined by the number of neighbors already built. We solve this problem for a variety of different graphs such as simple connected small-sized graphs, trees, cycles, wheels, grid graphs, ladder graphs, and complete bipartite graphs.

APA, Harvard, Vancouver, ISO, and other styles

31

Mughal, Aleem, and Noshad Jamil. "Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)." Journal of Mathematics 2021 (August 31, 2021): 1–16. http://dx.doi.org/10.1155/2021/1311269.

Full text

Abstract:

In this study, we used grids and wheel graphs G = V , E , F , which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set. The article addresses the problem to find the face irregularity strength of some families of generalized plane graphs under k -labeling of type α , β , γ . In this labeling, a graph is assigning positive integers to graph vertices, graph edges, or graph faces. A minimum integer k for which a total label of all verteices and edges of a plane graph has distinct face weights is called k -labeling of a graph. The in

APA, Harvard, Vancouver, ISO, and other styles

32

Basher, M., and Muhammad Kamran Siddiqui. "On even-odd meanness of super subdivision of some graphs." Proyecciones (Antofagasta) 41, no. 5 (2022): 1213–28. http://dx.doi.org/10.22199/issn.0717-6279-5302.

Full text

Abstract:

Graph Labeling is a significant area of graph theory that is used in a variety of applications like coding hypothesis, x-beam crystallography, radar, cosmology, circuit design, correspondence network tending to, and database administration. This study provides a general overview of graph naming in heterogeneous fields, however it primarily focuses on graph subdivision. The even vertex odd meanness of super subdivide of various graphs is discussed in this study. The graphs generated by super subdivided of path, cycle, comb, crown, and planar grid are even-odd mean graphs, according to our proof

APA, Harvard, Vancouver, ISO, and other styles

33

Uras, Tansel, and Sven Koenig. "Identifying Hierarchies for Fast Optimal Search." Proceedings of the International Symposium on Combinatorial Search 5, no. 1 (2021): 211–12. http://dx.doi.org/10.1609/socs.v5i1.18307.

Full text

Abstract:

For some search problems, the graph is known beforehand and there is time to preprocess the graph to make the search faster. One such example is video games, where one can often preprocess maps before a game is released or while a map is loaded into memory. The data produced by preprocessing should use only a small amount of memory, and, in case they are generated during runtime, preprocessing should be fast. Search with Subgoal Graphs (Uras, Koenig, and Hernandez 2013) was a non-dominated optimal path-planning algorithm in the Grid-Based Path Planning Competitions 2012 and 2013. During a prep

APA, Harvard, Vancouver, ISO, and other styles

34

Al Khabyah, Ali, Ali N. A. Koam, and Ali Ahmad. "Partition Resolvability of Nanosheet and Nanotube Derived from Octagonal Grid." Journal of Mathematics 2024 (February 19, 2024): 1–10. http://dx.doi.org/10.1155/2024/6222086.

Full text

Abstract:

Chemical graph theory, a branch of computational and applied mathematics, covers a very wide range of topics. As a result, the world of applied sciences heavily relies on graph theory. The concept of partition dimension has significant importance in the field of chemical graph theory. Although certain graphs have bounded partition dimensions, a graph’s partition dimension may be constant. In this study, we look at two alternative chemical structures made of an octagonal grid: nanosheets and nanotubes. We determined the partition dimension of an octagonal grid-generated nanosheet to be 3, and t

APA, Harvard, Vancouver, ISO, and other styles

35

PAULRAJA, P., and V. S. AGNES. "DEGREE DISTANCE OF PRODUCT GRAPHS." Discrete Mathematics, Algorithms and Applications 06, no. 01 (2014): 1450003. http://dx.doi.org/10.1142/s1793830914500037.

Full text

Abstract:

We determine the exact value of the degree distance of the cartesian product and the wreath product of two graphs. Also we apply our results to compute the exact degree distance of hypercube, torus, grid, Hamming graph and fence graph.

APA, Harvard, Vancouver, ISO, and other styles

36

Paulraja, P., and V. Sheeba Agnes. "Gutman index of product graphs." Discrete Mathematics, Algorithms and Applications 06, no. 04 (2014): 1450058. http://dx.doi.org/10.1142/s179383091450058x.

Full text

Abstract:

The exact value of the Gutman indices of the Cartesian product and the wreath product of graphs are obtained. Using the results obtained here, the exact Gutman indices of the hypercube, torus, grid, Hamming graph and the fence graph are given.

APA, Harvard, Vancouver, ISO, and other styles

37

Jobe, Amelia, Richard Ky, Sandra Luo, Akshay Dhamsania, Sumit Purohit, and Edoardo Serra. "Power Grid Anomaly Detection via Hybrid LSTM-GIN Model (Student Abstract)." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 21 (2024): 23525–27. http://dx.doi.org/10.1609/aaai.v38i21.30457.

Full text

Abstract:

Cyberattacks on power grids pose significant risks to national security. Power grid attacks typically lead to abnormal readings in power output, frequency, current, and voltage. Due to the interconnected structure of power grids, abnormalities can spread throughout the system and cause widespread power outages if not detected and dealt with promptly. Our research proposes a novel anomaly detection system for power grids that prevents overfitting. We created a network graph to represent the structure of the power grid, where nodes represent power grid components like generators and edges repres

APA, Harvard, Vancouver, ISO, and other styles

38

Shahzad,, M., R. Hasni,, I. Tarawneh,, and M. A. Asim,. "Computing the Edge Irregularity Strength of Some Classes of Grid Graphs." Malaysian Journal of Mathematical Sciences 18, no. 3 (2024): 617–30. http://dx.doi.org/10.47836/mjms.18.3.10.

Full text

Abstract:

Let G be a simple graph. A function ϕ:V(G)→{1,2,…,k} a vertex k-labeling which assigns labels to the vertices of G. For any edge xy in G, we define the weight of this edge as wϕ(xy)=ϕ(x)+ϕ(y). If all the edge weights are distinct, then ϕ is termed as an edge irregular k -labeling of G. The smallest possible value of k for which the graph G possesses an edge irregular k-labeling is denoted as the edge irregularity strength of G and is represented as es(G). In this paper, we investigate the edge irregular k-labeling of some classes of grid graphs, namely rhombic graph Rmn, triangular graph Lmn a

APA, Harvard, Vancouver, ISO, and other styles

39

Sapunov, Seregy. "Collectives of automata on infinite grid graph with deterministic vertex labeling." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 33 (December 27, 2019): 170–87. http://dx.doi.org/10.37069/1683-4720-2019-33-14.

Full text

Abstract:

Automata walking on graphs are a mathematical formalization of autonomous mobile agents with limited memory operating in discrete environments. Under this model broad area of studies of the behaviour of automata in finite and infinite labyrinths (a labyrinth is an embedded directed graph of special form) arose and intensively developing. Research in this regard received a wide range of applications, for example, in the problems of image analysis and navigation of mobile robots. Automata operating in labyrinths can distinguish directions, that is, they have a compass. This paper examines vertex

APA, Harvard, Vancouver, ISO, and other styles

40

Klostermeyer, William F., Margaret-Ellen Messinger, and Alejandro Angeli Ayello. "Disjoint dominating sets with a perfect matching." Discrete Mathematics, Algorithms and Applications 09, no. 05 (2017): 1750065. http://dx.doi.org/10.1142/s1793830917500653.

Full text

Abstract:

In this paper, we consider dominating sets [Formula: see text] and [Formula: see text] such that [Formula: see text] and [Formula: see text] are disjoint and there exists a perfect matching between them. Let [Formula: see text] denote the cardinality of smallest such sets [Formula: see text] in [Formula: see text] (provided they exist, otherwise [Formula: see text]). This concept was introduced in [W. F. Klostermeyer, M. E. Messinger and A. Angeli Ayello, An eternal domination problem in grids, Theory Appl. Graphs 4(1) (2017) 23pp.] in the context of studying a certain graph protection problem

APA, Harvard, Vancouver, ISO, and other styles

41

FÜRER, MARTIN, and SHIVA PRASAD KASIVISWANATHAN. "Approximately Counting Embeddings into Random Graphs." Combinatorics, Probability and Computing 23, no. 6 (2014): 1028–56. http://dx.doi.org/10.1017/s0963548314000339.

Full text

Abstract:

LetHbe a graph, and letCH(G) be the number of (subgraph isomorphic) copies ofHcontained in a graphG. We investigate the fundamental problem of estimatingCH(G). Previous results cover only a few specific instances of this general problem, for example the case whenHhas degree at most one (the monomer-dimer problem). In this paper we present the first general subcase of the subgraph isomorphism counting problem, which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labelling of the vertices such that every edge

APA, Harvard, Vancouver, ISO, and other styles

42

Casinillo, Leomarich F. "A CLOSER LOOK AT A PATH DOMINATION NUMBER IN GRID GRAPHS." Journal of Fundamental Mathematics and Applications (JFMA) 6, no. 1 (2023): 18–26. http://dx.doi.org/10.14710/jfma.v6i1.16608.

Full text

Abstract:

This article exposes the combinatorial formula that determines the pathdomination number in a grid graph and discusses some of its properties. Seven propertiesare derived regarding the path domination number of grid graphs. Furthermore, some additional properties as direct consequences of the derived main properties are alsodiscussed.

APA, Harvard, Vancouver, ISO, and other styles

43

Dai, Zemiao, Muhammad Naeem, Zainab Shafaqat, Manzoor Ahmad Zahid, and Shahid Qaisar. "On the P3-Coloring of Bipartite Graphs." Mathematics 11, no. 16 (2023): 3487. http://dx.doi.org/10.3390/math11163487.

Full text

Abstract:

The advancement in coloring schemes of graphs is expanding over time to solve emerging problems. Recently, a new form of coloring, namely P3-coloring, was introduced. A simple graph is called a P3-colorable graph if its vertices can be colored so that all the vertices in each P3 path of the graph have different colors; this is called the P3-coloring of the graph. The minimum number of colors required to form a P3-coloring of a graph is called the P3-chromatic number of the graph. The aim of this article is to determine the P3-chromatic number of different well-known classes of bipartite graphs

APA, Harvard, Vancouver, ISO, and other styles

44

Tibbles, Matthew, and Eric Melse. "A note on creating inset plots using graph twoway." Stata Journal: Promoting communications on statistics and Stata 23, no. 1 (2023): 265–75. http://dx.doi.org/10.1177/1536867x231162022.

Full text

Abstract:

Inset plots can be used to “zoom in” on densely populated areas of a graph or to add extra relevant data in the form of, for example, distribution plots. However, the standard Stata command for combining plots, graph combine, does not permit this type of seamless integration. Each plot within a graph combine object is allocated a grid cell that cannot be placed within another grid cell— at least not without certain (invariably unwanted) graphical complications. We present a fairly simple work-around to this issue using reproducible examples. The main idea is to plot insets along a second axis

APA, Harvard, Vancouver, ISO, and other styles

45

Elsonbaty, Ahmed A., and Salama Nagy Daoud. "Edge Even Graceful Labeling of Cylinder Grid Graph." Symmetry 11, no. 4 (2019): 584. http://dx.doi.org/10.3390/sym11040584.

Full text

Abstract:

Edge even graceful labeling (e.e.g., l.) of graphs is a modular technique of edge labeling of graphs, introduced in 2017. An e.e.g., l. of simple finite undirected graph G = ( V ( G ) , E ( G ) ) of order P = | ( V ( G ) | and size q = | E ( G ) | is a bijection f : E ( G ) → { 2 , 4 , … , 2 q } , such that when each vertex v ∈ V ( G ) is assigned the modular sum of the labels (images of f ) of the edges incident to v , the resulting vertex labels are distinct mod 2 r , where r = max ( p , q ) . In this work, the family of cylinder grid graphs are studied. Explicit formulas of e.e.g., l. for a

APA, Harvard, Vancouver, ISO, and other styles

46

Yang, Hongying, Gaoshang Zhao, Lv Xianjin, Zhang Li, and Daowei Liu. "Construction and application of static stability intelligent evaluator for large power grid from the perspective of knowledge graph." Journal of Physics: Conference Series 2846, no. 1 (2024): 012026. http://dx.doi.org/10.1088/1742-6596/2846/1/012026.

Full text

Abstract:

Abstract Relying on information technology such as artificial intelligence, knowledge analysis on a large amount of high-dimensional real-time measurement and simulation information, and deep excavation of stable operation situations in the power grid are the core of real time intelligent security defense of large power grid. In this paper, from the perspective of the knowledge graph, considering the stability state evaluation index and optimizing control strategy information of different operation scenarios of power grid comprehensively, using the integration mechanism of information system a

APA, Harvard, Vancouver, ISO, and other styles

47

Yingtaweesittikul, Hatairat, Sayan Panma, and Penying Rochanakul. "An Algorithm for the Numbers of Homomorphisms from Paths to Rectangular Grid Graphs." Mathematics 11, no. 11 (2023): 2587. http://dx.doi.org/10.3390/math11112587.

Full text

Abstract:

Let G and H be graphs. A mapping f from the vertices of G to the vertices of H is known as a homomorphism from G to H if, for every pair of adjacent vertices x and y in G, the vertices f(x) and f(y) are adjacent in H. A rectangular grid graph is the Cartesian product of two path graphs. In this paper, we provide a formula to determine the number of homomorphisms from paths to rectangular grid graphs. This formula gives the solution to the problem concerning the number of walks in the rectangular grid graphs.

APA, Harvard, Vancouver, ISO, and other styles

48

Li, Dong, Bin Yang, Lei Liu, et al. "Research on a Unified Data Model for Power Grids and Communication Networks Based on Graph Databases." Electronics 13, no. 11 (2024): 2014. http://dx.doi.org/10.3390/electronics13112014.

Full text

Abstract:

With the continuous development of the power grid, its structure is becoming increasingly complex. The occurrence of faults in transmission lines may lead to cascading failures in the power grid, ultimately resulting in widespread power outages. The transmission of equipment information and the sending of fault reports in the power grid rely on the power communication network. This network is crucial for ensuring the safe, stable, and economical operation of the power grid. As the number of devices in the power grid increases and sensor technology becomes more widespread, the volume of data ge

APA, Harvard, Vancouver, ISO, and other styles

49

FU, BIN, SORINEL A. OPRISAN, and LIZHE XU. "MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING." International Journal of Computational Geometry & Applications 18, no. 05 (2008): 389–413. http://dx.doi.org/10.1142/s0218195908002696.

Full text

Abstract:

We introduce the concept of multi-directional width-bounded geometric separators and obtain an improved separator for grid graphs. This yields an improved exact algorithm for the protein folding problem in the HP-model. For a grid graph G with n grid points P, there exists a separator A ⊆ P such that A has at most [Formula: see text] points, and G − A has two disconnected subgraphs each with at most [Formula: see text] nodes. This improves the previous upper bound of [Formula: see text]. We also derive a [Formula: see text] lower bound for such a separator in grid graphs.

APA, Harvard, Vancouver, ISO, and other styles

50

Beigie, Darin. "Zooming In on Slope in Curved Graphs." Mathematics Teaching in the Middle School 5, no. 5 (2000): 330–34. http://dx.doi.org/10.5951/mtms.5.5.0330.

Full text

Abstract:

Students in a middle school mathematics club used the zooming technology of Green Globs and Graphing Equations (Dugdale and Kibbey 1996) to study slope in curved graphs. Seventh and eighth graders investigated some elementary curved graphs by zooming in on evenly spaced points along a graph until the graph appeared linear and slope could be calculated. The slopes at the various points were then plotted on a separate grid and joined to make a graph of the slope itself and to discover the algebraic equation describing the new graph. The zooming technology gave the students a concrete, visual con

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!