Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.

In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let G be a graph of even order. The matching preclusion number mp(G) is defined as the minimum number of edges whose deletion results in a subgraph without perfect matchings. Many interconnection networks are super matched, that is, their optimal matching preclusion sets are precisely those...

This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...

We determine the maximum number of edges that a planar graph can have as function its degree and matching number.

We determine the maximum number of edges that a chordal graph G can have if its degree, $$\varDelta (G)$$ , and matching number, $$\nu are bounded. To do so, we show for every $$d,\nu \in \mathbb {N}$$ there exists with (G)<d$$ (G)<\nu $$ whose matches upper bound, while having simple structure: is disjoint union cliques stars.

In this article an Archimedean spiral antenna is designed and analyzed that has good operation in broadband application. By analyzing this design, the effects that different parameters have on antenna operation will be studied and ways of optimization will be found.  Influences of cavity height and number of turns to obtain good matching and gain in a frequency interval of 4 to 18 GHz will be d...

In this paper, we study merge trees induced by a discrete Morse function on tree. Given function, provide method to constructing an tree and define new notion of equivalence functions based the We then relate matching number certain invariant Finally, count that can be star graph characterize

Given a graph G on the vertex set V, non-matching complex of G, denoted by NMk(G), is family subgraphs G??G whose matching number ?(G?) strictly less than k. As an attempt to extend result Linusson, Shareshian and Welker homotopy types NMk(Kn) NMk(Kr,s) arbitrary graphs we show that (i) NMk(G) (3k?3)-Leray, (ii) if bipartite, then (2k?2)-Leray. This obtained analyzing homology links non-empty f...