Results 1 to 10 of about 121,385 (119)

CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN

open access: yesBarekeng, 2022
Let  be a simple, connected, and undirected graph. The graph  can be represented as a matrix such as antiadjacency matrix. An antiadjacency matrix for an undirected graph with order  is a matrix that has an order  and symmetric so that the ...
Wahri Irawan, Kiki Ariyanti Sugeng
doaj   +1 more source

Identifying the Shortest Path of a Semidirected Graph and Its Application

open access: yesMathematics, 2022
The basic goal of this research is to find the shortest path of a semidirected graph and apply it to the road network system. In the field of graph theory, networks are described as directed graphs, undirected graphs, or a combination of both.
Rakhi Das   +4 more
doaj   +1 more source

Descending endomorphism graphs of groups

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
We define a new type of graph of a group with reference to the descending endomorphisms of the group. A descending endomorphism of a group is an endomorphism that induces a corresponding endomorphism in every homomorphic image of the group. We define the
Vinay Madhusudanan   +2 more
doaj   +1 more source

Z-graphic topology on undirected graph

open access: yesKuwait Journal of Science, 2023
In this work, we define $\mathcal{Z}_{G}$ a topology on the vertex set of a graph $G$ which preserves the connectivity of the graph, called $\mathcal{Z}$-graphic topology. We prove that two isomorphic graphs have homeomorphic and symmetric $\mathcal{Z}$-
Hanan Omer Zomam, Makkia Dammak
doaj   +1 more source

Optimal Solution of Max-Cut Problem Using Quantum Adiabatic Approximation [PDF]

open access: yesJisuanji gongcheng, 2020
When using classical approximation algorithm to solve the max-cut problem,the time complexity increases with the complexity of graph.In order to improve the solution efficiency,this paper uses quantum adiabatic approximation algorithm to solve the ground
WANG Fumin, NI Ming, ZHOU Ming, WU Yongzheng
doaj   +1 more source

Research and Application of Hypernetwork Energy

open access: yesJisuanji kexue yu tansuo, 2021
Graph energy plays an important role in research of graph theory. Graph energy and many other similar variants have been applied in many other types of graphs, e.g., undirected graphs, oriented graphs, mixed graphs, and so on.
LIU Shengjiu, LI Tianrui, LIU Jia, XIE Peng
doaj   +1 more source

Undirected Graphs: Is the Shift-Enabled Condition Trivial or Necessary?

open access: yesIEEE Access, 2021
With the growing application of undirected graphs for signal/image processing on graphs and distributed machine learning, we demonstrate that the shift-enabled condition is as necessary for undirected graphs as it is for directed graphs.
Liyan Chen   +4 more
doaj   +1 more source

Reward shaping using directed graph convolution neural networks for reinforcement learning and games

open access: yesFrontiers in Physics, 2023
Game theory can employ reinforcement learning algorithms to identify the optimal policy or equilibrium solution. Potential-based reward shaping (PBRS) methods are prevalently used for accelerating reinforcement learning, ensuring the optimal policy ...
Jianghui Sang   +4 more
doaj   +1 more source

Three Representation Types for Systems of Forms and Linear Maps

open access: yesMathematics, 2021
We consider systems of bilinear forms and linear maps as representations of a graph with undirected and directed edges. Its vertices represent vector spaces; its undirected and directed edges represent bilinear forms and linear maps, respectively.
Abdullah Alazemi   +4 more
doaj   +1 more source

Game of Life-like Opinion Dynamics: Generalizing the Underpopulation Rule

open access: yesAppliedMath, 2022
Graph dynamics for a node-labeled graph is a set of updating rules describing how the labels of each node in the graph change in time as a function of the global set of labels.
Miriam Di Ianni
doaj   +1 more source

Home - About - Disclaimer - Privacy