Results 31 to 40 of about 10,447 (245)
BIPARTITE GRAPH ASSOCIATED WITH ELEMENTS AND COSETS OF SUBRINGS OF FINITE RINGS
Barekeng, 2023 Let be a finite ring. The bipartite graph associated to elements and cosets of subrings of is a simple undirected graph with vertex set , where is the set of all subrings of , and two vertices and are adjacent if and only if In this study, we ...
Hubbi Muhammad +3 more
doaj +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
Dynamic Load Balancing Algorithm Based on Optimal Matching of Weighted Bipartite Graph
IEEE Access, 2022 When the server cluster is processing concurrent task requests, if the performance difference among servers is not fully considered, task allocation will be unreasonable, which will lead to an increase in task making span and a decrease in cluster ...
Wei Hou +3 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 1999 Two graphs \(G\) and \(H\) on the vertex set \(V\) are \(P_4\)-isomorphic if there is a permutation \(\pi\) on \(V\) such that, for all subsets \(S\) of \(V\), \(S\) induces a chordless \(P_4\) in \(G\) if and only if \(\pi (S)\) induces a \(P_4\) in \(H\). The author characterizes all graphs \(P_4\)-isomorphic to a bipartite graph. For example, we can
openaire +1 more source
Bipartite dimensions and bipartite degrees of graphs
Discrete Mathematics, 1996 Let \(G=(V,E)\) be an undirected graph with finite nonempty vertex set \(V\) and irreflexive edge set \(E\). The irreflexive complement of \(G\) is denoted by \(G^c=(V,E^c)\) with \(E^c=\{\{u,v\}:u, v\in V, u\neq v, \{u,v\}\not\in E\}\). A cover of a graph \(G\) is a family of complete bipartite subgraphs of \(G\) whose edges cover the edges of \(G ...
Peter C. Fishburn, Peter L. Hammer
openaire +2 more sources
Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
International Journal of Mathematics and Mathematical Sciences, 2008 We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp ...
Salah Al-Addasi, Hasan Al-Ezeh
doaj +1 more source
A Note on the Permanental Roots of Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2014 It is well-known that any graph has all real eigenvalues and a graph is bipartite if and only if its spectrum is symmetric with respect to the origin.
Zhang Heping, Liu Shunyi, Li Wei
doaj +1 more source
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Advanced Materials, EarlyView.Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo +6 more
wiley +1 more source
Advances in Applied Mathematics, 1999 Let \(R = K[t_1, \ldots , t_d]\) be the polynomial ring in \(d\) indeterminates over a field \(K\). If \(G\) is a bipartite graph on the vertex set \(\{ 1, \ldots , d \}\), define \(K[G]\) to be the subalgebra of \(R\) generated by all monomials \(t_i t_j\) such that \(\{ i,j \}\) is an edge of \(G\). It is shown that if every \(n\)-cycle \((n \geq 6)\)
Ohsugi, Hidefumi, Hibi, Takayuki
openaire +2 more sources