Results 31 to 40 of about 795,931 (124)
On almost hypohamiltonian graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.
Jan Goedgebeur, Carol T. Zamfirescu
doaj +1 more source
Optimal Fractional Fourier Filtering in Time-vertex Graphs signal processing [PDF]
arXiv, 2022 Graph signal processing (GSP) is an effective tool in dealing with data residing in irregular domains. In GSP, the optimal graph filter is one of the essential techniques, owing to its ability to recover the original signal from the distorted and noisy version.
arxiv
Knots and Knot-Hyperpaths in Hypergraphs
Mathematics, 2022 This paper deals with some theoretical aspects of hypergraphs related to hyperpaths and hypertrees. In ordinary graph theory, the intersecting or adjacent edges contain exactly one vertex; however, in the case of hypergraph theory, the adjacent or ...
Saifur Rahman +3 more
doaj +1 more source
MathematicsThe incidence of edges on vertices is a cornerstone of graph theory, with profound implications for various graph properties and applications. Understanding degree distributions and their implications is crucial for analyzing and modeling real-world ...
A. R. Nagalakshmi +3 more
doaj +1 more source
On dominating graph of graphs, median graphs and partial cubes, and graphs in which complement of every minimal dominating set is minimal dominating [PDF]
arXiv, 2022 The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating graph has become an increasingly interesting subject in domination theory.
arxiv
Social Structure Decomposition With Security Issue
IEEE Access, 2019 Social structure decomposition has been a valuable research topic in the study of social networks, and it still has many unresolved problems. At the same time, an increasing number of people pays attention to the security issue that is worth considering ...
Wenshun Teng +3 more
doaj +1 more source
Star metric dimension of complete, bipartite, complete bipartite and fan graphs
International Journal of Trends in Mathematics Education Research, 2022 One of the topics in graph theory that is interesting and developed continuously is metric dimension. It has some new variation concepts, such as star metric dimension.
Reni Umilasari +2 more
doaj +1 more source
Spectral characterizations of sun graphs and broken sun graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Several matrices can be associated to a graph such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question ''Which graphs are determined by their spectrum?''
Romain Boulet
doaj +1 more source
Ars Mathematica Contemporanea, 17(2):349--368, 2019, 2018 We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the edges with end-vertex $u$ lie on.
arxiv +1 more source
Computing Some Topological Indices of Two Kinds of Dendrimer Graphs Gn and Hn
Journal of MathematicsDendrimer molecules are macromolecules which have many applications in nanosciences, drug delivery, biology, and different areas of sciences. Topological indices of chemical graph theory are numerical descriptor of a molecular structure.
Hojat Kaviani, Lotfallah Pourfaraj
doaj +1 more source