Results 61 to 70 of about 1,017,247 (314)
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
The Complexity of Independent Set Reconfiguration on Bipartite Graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2017 We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs under all three commonly studied reconfiguration models. We show that under the token jumping or token addition/removal model, the problem is NP-complete. For the
D. Lokshtanov, A. Mouawad
semanticscholar +1 more source
Coded Caching via Line Graphs of Bipartite Graphs [PDF]
Information Theory Workshop, 2018 We present a coded caching framework using line graphs of bipartite graphs. A clique cover of the line graph describes the uncached subfiles at users.
Prasad Krishnan
semanticscholar +1 more source
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
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
Binomial edge ideals of bipartite graphs [PDF]
European journal of combinatorics (Print), 2017 We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the converse of a well-
D. Bolognini +2 more
semanticscholar +1 more source
Discrete Applied Mathematics, 1984 The isoperimetric constant \(i(G)\) of a cubic graph \(G\) is \(i(G)=\min | \partial U| /| U|\) where \(|\cdot|\) is cardinality, \(U\) runs over all subsets of the vertex set \(VG\) satisfying \(| U| \leq \frac12 | VG|\), and \(| \partial U|\) is the number of edges running from \(U\) to the complement \(VG\backslash U\).
openaire +1 more source
European Journal of Combinatorics, 1996 Graphs that are obtained from single edges and even cycles by successive amalgamations are called cellular graphs. Especially cellular bipartite graphs are investigated in this paper. Since graphs with their shortest-path metrics are particular instances of finite metric spaces, these investigations are done from a metric point of view.
Hans-Jürgen Bandelt, Victor Chepoi
openaire +1 more source
Regular embeddings of complete bipartite maps: classification and enumeration [PDF]
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined.
Jones, Gareth
core +1 more source