Results 31 to 40 of about 6,109 (206)
Some Properties of Regular Line Graphs
مجلة علوم ذي قار, 2019 In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources
Algorithms, 2022 Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete ...
Ahmed El-Mesady +3 more
doaj +1 more source
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
A Mixed Strategy of Higher-Order Structure for Link Prediction Problem on Bipartite Graphs
Mathematics, 2021 Link prediction tasks have an extremely high research value in both academic and commercial fields. As a special case, link prediction in bipartite graphs has been receiving more and more attention thanks to the great success of the recommender system in
Chao Li +5 more
doaj +1 more source
Cohen-macaulay bipartite graphs [PDF]
Archiv der Mathematik, 1997 Let \(G\) be a graph on the vertex set \(V=\{x_1, \dots, x_n\}\). Let \(k\) be a field and let \(R\) be the polynomial ring \(k[x_1, \dots, x_n]\). The graph ideal \(I(G)\), associated to \(G\), is the ideal of \(R\) generated by the set of square-free monomials \(x_ix_j\) so that \(x_i\) is adjacent to \(x_j\). The graph \(G\) is Cohen-Macaulay over \(
Estrada, Mario, Villarreal, Rafael H.
openaire +2 more sources
Opuscula Mathematica, 2011 It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph \(K_{a,b}\), is decomposable into open trails of prescribed even lengths.
Sylwia Cichacz, Agnieszka Görlich
doaj +1 more source
End Behavior of the Threshold Protocol Game on Complete and Bipartite Graphs
GamesThe threshold protocol game is a graphical game that models the adoption of an idea or product through a population. There are two states players may take in the game, and the goal of the game is to motivate the state that begins in the minority to ...
Alexandra Fedrigo
doaj +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source
Enumeration of Bipartite Graphs and Bipartite Blocks [PDF]
The Electronic Journal of Combinatorics, 2014 We use the theory of combinatorial species to count unlabelled bipartite graphs and bipartite blocks (nonseparable or 2-connected graphs). We start with bicolored graphs, which are bipartite graphs that are properly colored in two colors. The two-element group $\mathfrak{S}_2$ acts on these graphs by switching the colors, and connected bipartite graphs
Gainer-Dewar, Andrew, Gessel, Ira M.
openaire +3 more sources
H-Relation Personalized Communication Strategy
Computer Science, 2010 This paper considers the communication patterns arising from the partition of geometricaldomain into sub-domains, when data is exchanged between processors assigned to adjacentsub-domains.
Maciej Paszyński
doaj +1 more source