Recently Published
Journal article

Some Families of Graphs with No Nonzero Real Domination Roots

Interlace Polynomials of Friendship Graphs

Rainbow Perfect Domination in Lattice Graphs

On Maximum Signless Laplacian Estrada Index of Graphs with Given Parameters II

Ramanujan Graphs Arising as Weighted Galois Covering Graphs

Journal article

Computing the Edge Irregularity Strengths of Chain Graphs and the Join of Two Graphs

Journal article

Upper Bounds on the Bondage Number of a Graph

Journal article

On Total Edge Product Cordial Labeling of Fullerenes

Journal article

New Bounds on the Hyper-Zagreb Index for the Simple Connected Graphs

Journal article

Computing the Edge Irregularity Strengths of Chain Graphs and the Join of Two Graphs

Journal article

Upper Bounds on the Bondage Number of a Graph

Journal article

On Total Edge Product Cordial Labeling of Fullerenes

Journal article

New Bounds on the Hyper-Zagreb Index for the Simple Connected Graphs

Most Viewed
Journal article

The Eccentric-distance Sum of Some Graphs

Let $G = (V,E)$ be a simple connected graph. Theeccentric-distance sum of $G$ is defined as$\xi^{ds}(G) =\ds\sum_{\{u,v\}\subseteq V(G)} [e(u)+e(v)] d(u,v)$, where $e(u)$ %\dsis the eccentricity of the vertex $u$ in $G$ and $d(u,v)$ is thedistance between $u$ and $v$. In this paper, we establish formulaeto calculate the eccentric-distance sum for some graphs, namelywheel, star, broom, lollipop, double star, friendship, multi-stargraph and the join of $P_{n-2}$ and $P_2$.
Journal article

Inverse Graphs Associated with Finite Groups

Let $(\Gamma,*)$ be a finite group and $S$ a possibly empty subset of $\Gamma$ containing its non-self-invertible elements. In this paper, we introduce the inverse graph associated with $\Gamma$ whose set of vertices coincides with $\Gamma$ such that two distinct vertices $u$ and $v$ are adjacent if and only if either $u * v\in S$ or $v * u\in S$. We then investigate its algebraic and combinatorial structures.
Journal article

A Note on the Edge Roman Domination in Trees

Journal article

Efficient Maximum Matching Algorithms for Trapezoid Graphs

Journal article

On the Connectivity of $K$-distance Graphs

Journal article

On the Spectrum of a Class of Distance-transitive Graphs

Journal article

A Note on the Edge Roman Domination in Trees

Journal article

Efficient Maximum Matching Algorithms for Trapezoid Graphs

Journal article

On the Connectivity of $K$-distance Graphs

Journal article

On the Spectrum of a Class of Distance-transitive Graphs

Journal article

Automorphism Group of Certain Power Graphs of Finite Groups

Journal article

On Size Multipartite Ramsey Numbers for Stars Versus Paths and Cycles

Journal article

On H-irregularity Strengths of G-amalgamation of Graphs

Suggested For You
Journal article

On Middle Cube Graphs

We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors).
Journal article

Note on Parity Factors of Regular Graphs

Journal article

The Manhattan Product of Digraphs

Journal article

Log-concavity of the Genus Polynomials of Ringel Ladders

Journal article

Super Edge-magic Labeling of Graphs: Deficiency and Maximality

Journal article

Note on Parity Factors of Regular Graphs

Journal article

The Manhattan Product of Digraphs

Journal article

Log-concavity of the Genus Polynomials of Ringel Ladders

Journal article

Super Edge-magic Labeling of Graphs: Deficiency and Maximality

Journal article

Computation of Gutman Index of Some Cactus Chains

Journal article

Spectra of the Extended Neighborhood Corona and Extended Corona of Two Graphs

Journal article

Parsimonious Edge-coloring on Surfaces

Journal article

New Measures of Graph Irregularity

Journal article

Intersecting Longest Paths and Longest Cycles: a Survey

Read more articles
Take the red pill. Enhance your publishing experience.
This academic journal is powered by Neliti, a free website builder for academic content providers. Migrate your repository, journal or conference to Neliti now and discover a world of publishing opportunities. Migrate Now right-arrow-icon