Results 51 to 60 of about 140,780 (247)
On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
Algorithms, 2023 Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications.
Ahmed El-Mesady +3 more
doaj +1 more source
Groups having complete bipartite divisor graphs for their conjugacy class sizes [PDF]
, 2013 Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G-Z (where Z denotes the centre of G) and the set of prime numbers that divide ...
Hafezieh, Roghayeh, Spiga, Pablo
core
Generalized Tur\'an problems for disjoint copies of graphs
, 2018 Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices is denoted by $ex(n,H,F)$. We investigate the function $ex(n,H,kF)$, where $kF$ denotes $k$ vertex disjoint copies of a fixed graph $F$.
Gerbner, Dániel +2 more
core +1 more source
The Anatomical Record, EarlyView.Examples from the graphic library depicting morphologies of interparietal bones, ossicles at lambda, mendosal sutures, and intrasutural ossicles. Abstract Due to its complex ossification during development, the superior region of the human occipital bone is a frequent site of supernumerary bones known as interparietal bones.
Melissa D. Clarkson +4 more
wiley +1 more source
Generating facets for the cut polytope of a graph by triangular elimination [PDF]
, 2006 The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of
Avis, David +2 more
core +2 more sources
Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph
, 2016 A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $G \Box H$ is an efficient open domination graph when ...
Peterin, Iztok +3 more
core +1 more source
A typology of schools across the four nations of the United Kingdom: Class, race and geography
British Educational Research Journal, EarlyView.Abstract In this paper we analyse the hierarchical field of schools across the United Kingdom during the transition to university and suggest that there are five socially distinct clusters of schools. Our five‐cluster typology of UK schools is composed of an established group of elite private and state schools, schools for the white rural and suburban ...
Sol Gamsu, Håkan Forsberg
wiley +1 more source
The n-Hosoya Polynomials of the Composite of Some Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2013 It is not easy to find the n-Hosoya polynomial of the compound graphs constructed in the form G1⊠G2 for any two disjoint connected graphs and .Therefore, in this paper, we obtain n-Hosoya polynomial of G1⊠G2 when is a complete graph and is a special ...
Ahmed Ali
doaj +1 more source
Generalized inverses in graph theory
AKCE International Journal of Graphs and Combinatorics, 2023 –In this article, some interesting applications of generalized inverses in the graph theory are revisited. Interesting properties of generalized inverses are employed to make the proof of several known results simpler, and several techniques such as ...
Umashankara Kelathaya +2 more
doaj +1 more source
Restricted Tweedie stochastic block models
Canadian Journal of Statistics, EarlyView.Abstract The stochastic block model (SBM) is a widely used framework for community detection in networks, where the network structure is typically represented by an adjacency matrix. However, conventional SBMs are not directly applicable to an adjacency matrix that consists of nonnegative zero‐inflated continuous edge weights.
Jie Jian, Mu Zhu, Peijun Sang
wiley +1 more source