Results 71 to 80 of about 85,296 (298)

Subsquares in Random Latin Squares and Rectangles

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A k×n $k\times n$ partial Latin rectangle is C‐sparse $C \mbox{-} \mathrm{sparse}$ if the number of nonempty entries in each row and column is at most C $C$ and each symbol is used at most C $C$ times. We prove that the probability a uniformly random k×n $k\times n$ Latin rectangle, where k<(1∕2−α)n $k\lt (1\unicode{x02215}2-\alpha )n ...
Alexander Divoux, Tom Kelly, Camille Kennedy, Jasdeep Sidhu   +3 more
wiley   +1 more source

Nullity and Bounds to the Nullity of Dendrimer Graphs [PDF]

Al-Rafidain Journal of Computer Sciences and Mathematics, 2013
In this paper, a high zero-sum weighting is applied to evaluate the nullity of a dendrimer graph   for some special graphs such as cycles, paths, complete graphs, complete bipartite graphs and  star graphs.
Khidir Sharaf, Didar Ali
doaj   +1 more source

Detour Global Domination for Degree Splitting graphs of some graphs

Ratio Mathematica, 2023
In this paper, we introduced the new concept detour global domination number for degree splitting graph of standard graphs. The detour global dominating sets in some standard and special graphs are determined.
C. Jayasekaran, S.V. Ashwin Prakash
doaj   +1 more source

Modularity of nearly complete graphs and bipartite graphs [PDF]

, 2023
Colin McDiarmid, Fiona Skerman
openalex   +1 more source

Perfect Matching Under Precedence Constraints

Networks, EarlyView.
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley   +1 more source

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

Fuzzy dominator coloring on fuzzy soft graphs

Ratio Mathematica, 2023
A fuzzy soft dominator colouring of a fuzzy soft graph $G^S$(T,V) is an appropriate fuzzy soft colouring such that every single vertex of $G^S$(T,V) dominate entire vertex of a colour group.
Jahir Hussain Rasheed, Afya Farhana
doaj   +1 more source

The IC-Indices of Complete Bipartite Graphs [PDF]

The Electronic Journal of Combinatorics, 2008
Let $G$ be a connected graph, and let $f$ be a function mapping $V(G)$ into ${\Bbb N}$. We define $f(H)=\sum_{v\in{V(H)}}f(v)$ for each subgraph $H$ of $G$. The function $f$ is called an IC-coloring of $G$ if for each integer $k$ in the set $\{1,2,\cdots,f(G)\}$ there exists an (induced) connected subgraph $H$ of $G$ such that $f(H)=k$, and the IC ...
Shiue, Chin-Lin, Fu, Hung-Lin
openaire   +2 more sources

Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study

Networks, EarlyView.
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk, Stefan Voß, Raka Jovanovic   +2 more
wiley   +1 more source

Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs [PDF]

, 2023
André Schulz
openalex   +1 more source