The maximum and minimum degrees of random bipartite multigraphs

2011 ◽  
Vol 31 (3) ◽  
pp. 1155-1166 ◽  
Author(s):  
Ailian Chen ◽  
Fuji Zhang ◽  
Hao Li
Keyword(s):  
Minimum Degrees

scholarly journals A new graph over semi-direct products of groups

Filomat ◽  
2016 ◽  
Vol 30 (3) ◽  
pp. 611-619
Author(s):  
Sercan Topkaya ◽  
Sinan Cevik
Keyword(s):  
Chromatic Number ◽  
Final Section ◽  
Degree Sequence ◽  
Domination Number ◽  
Clique Number ◽  
Perfect Graph ◽  
Direct Products ◽  
Products Of Groups ◽  
Minimum Degrees ◽  
Product Of Groups

In this paper, by establishing a new graph ?(G) over the semi-direct product of groups, we will first state and prove some graph-theoretical properties, namely, diameter, maximum and minimum degrees, girth, degree sequence, domination number, chromatic number, clique number of ?(G). In the final section we will show that ?(G) is actually a perfect graph.

2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees

2010 ◽  
Vol 24 (2) ◽  
pp. 486-504 ◽  
Author(s):  
Andrzej Czygrinow ◽  
Louis DeBiasio ◽  
H. A. Kierstead
Keyword(s):  
Bipartite Graphs ◽  
Minimum Degrees

Graph Indices for Cartesian Product of F-sum of Connected Graphs

2021 ◽  
Vol 24 ◽  
Author(s):  
Jia-Bao Liu ◽  
Muhammad Imran ◽  
Shakila Baby ◽  
Hafiz Muhammad Afzal Siddiqui ◽  
Muhammad Kashif Shafiq
Keyword(s):  
Computer Science ◽  
Topological Index ◽  
Cartesian Product ◽  
Chemical Properties ◽  
Physical And Chemical Properties ◽  
Finite Graphs ◽  
Zagreb Indices ◽  
Physical And Chemical ◽  
Minimum Degrees ◽  
And Chemical Properties

Background: A topological index is a real number associated to a graph, that provides information about its physical and chemical properties along with their correlations.Topological indices are being used successfully in Chemistry, Computer Science and many other fields. Aim and Objective: In this article, we apply the well known, Cartesian product on F-sums of connected and finite graphs. We formulate sharp limits for some famous degree dependent indies. Results: Zagreb indices for the graph operations T(G), Q(G), S(G), R(G) and their F-sums have been computed. By using orders and sizes of component graphs, we derive bounds for Zagreb indices, F-index and Narumi-Katayana index. Conclusion: The formulation of expressions for the complicated products on F-sums, in terms of simple parameters like maximum and minimum degrees of basic graphs, reduces the computational complexities.

scholarly journals Circumferences and minimum degrees in 3-connected claw-free graphs

2009 ◽  
Vol 309 (11) ◽  
pp. 3580-3587 ◽  
Author(s):  
MingChu Li ◽  
Yongrui Cui ◽  
Liming Xiong ◽  
Yuan Tian ◽  
He Jiang ◽  
...  
Keyword(s):  
Minimum Degrees

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs

2016 ◽  
Vol 25 (6) ◽  
pp. 850-869
Author(s):  
DENNIS CLEMENS ◽  
YURY PERSON
Keyword(s):  
Vertex Degree ◽  
Uniform Hypergraph ◽  
Minimal Graphs ◽  
Uniform Hypergraphs ◽  
Minimum Degrees ◽  
Monochromatic Copy

A uniform hypergraph H is called k-Ramsey for a hypergraph F if, no matter how one colours the edges of H with k colours, there is always a monochromatic copy of F. We say that H is k-Ramsey-minimal for F if H is k-Ramsey for F but every proper subhypergraph of H is not. Burr, Erdős and Lovasz studied various parameters of Ramsey-minimal graphs. In this paper we initiate the study of minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs. We show that the smallest minimum vertex degree over all k-Ramsey-minimal 3-uniform hypergraphs for Kt(3) is exponential in some polynomial in k and t. We also study the smallest possible minimum codegree over 2-Ramsey-minimal 3-uniform hypergraphs.

Sign in / Sign up

Export Citation Format

Share Document