Determining The Number of Connected Vertex Labeled Graphs of Order Seven without Loops by Observing The Patterns of Formula for Lower Order Graphs with Similar Property

Determining The Number of Connected Vertex Labeled Graphs of Order Seven without Loops by Observing The Patterns of Formula for Lower Order Graphs with Similar Property

Bibliographic Details
Main Authors:	Muslim Ansori, Wamiliana, Fadila Cahya Puri
Format:	Article
Language:	English
Published:	Magister Program of Material Sciences, Graduate School of Universitas Sriwijaya 2021-10-01
Series:	Science and Technology Indonesia
Online Access:	https://sciencetechindonesia.com/index.php/jsti/article/view/388

Similar Items

Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
by: Wamiliana, et al.
Published: (2020-10-01)

Enumerate the Number of Vertices Labeled Connected Graph of Order Seven Containing No Parallel Edges
by: Muslim Ansori, et al.
Published: (2022-07-01)

The relationship of the formulas for the number of connected vertices labeled graphs with order five and order six without loops
by: Amanto Amanto, et al.
Published: (2021-11-01)

On Vertex-Uniprimitive Non-Cayley Graphs of Order pq
by: Mohammad Ali Iranmanesh
Published: (2020-12-01)

Chromatic number of super vertex local antimagic total labelings of graphs
by: Fawwaz F. Hadiputra, et al.
Published: (2021-10-01)

The vertex steiner number of a graph
by: J. JOHN
Published: (2020-06-01)

Multiples of left loops and vertex-transitive graphs
by: Mwambene Eric
Published: (2005-06-01)

List-antimagic labeling of vertex-weighted graphs
by: Zhanar Berikkyzy, et al.
Published: (2021-12-01)

ON THE CROSSING NUMBER OF THE JOIN OF FIVE VERTEX GRAPH WITH THE DISCRETE GRAPH Dn
by: Štefan BEREŽNÝ, et al.
Published: (2017-09-01)

On the edge chromatic vertex stability number of graphs
by: Saeid Alikhani, et al.
Published: (2023-01-01)

Domination number and feedback vertex number of complements of line graphs
by: Xiaohong Chen, et al.
Published: (2022-09-01)

The Vertex-Rainbow Connection Number of Some Graph Operations
by: Li Hengzhe, et al.
Published: (2021-05-01)

On the chromatic number of graphs with some restriction of vertex degrees
by: S.N. Selezneva
Published: (2020-12-01)

The Connected Vertex Strong Geodetic Number of a Graph
by: C Saritha, et al.
Published: (2023-01-01)

EDGE-TO-VERTEX DETOUR MONOPHONIC NUMBER OF A GRAPH
by: P. TITUS, et al.
Published: (2014-09-01)

The Rainbow Vertex-Connection Number of Star Fan Graphs
by: Ariestha Widyastuty Bustan, et al.
Published: (2018-12-01)

The forcing vertex detour monophonic number of a graph
by: P. Titus, et al.
Published: (2016-04-01)

Irregular total labeling on complete bipartite graph and union complete bipartite graphs
by: Daoud, Jamal Ibrahim, et al.
Published: (2010)

Vertex sequences in graphs
by: Teresa W. Haynes, et al.
Published: (2021-03-01)

Local Super Antimagic Total Labeling for Vertex Coloring of Graphs
by: Slamin Slamin, et al.
Published: (2020-11-01)

Vertex Labeling and Routing for Farey-Type Symmetrically-Structured Graphs
by: Wenchao Jiang, et al.
Published: (2018-09-01)

Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs
by: Jana Fortes, et al.
Published: (2023-07-01)

Vertex order with optimal number of adjacent predecessors
by: Jérémy Omer, et al.
Published: (2020-01-01)

Extremal number of theta graphs of order 7
by: Mohammad M. M. Jaradat, et al.
Published: (2020-10-01)

Forcing vertex square free detour number of a graph
by: G Priscilla Pacifica, et al.
Published: (2023-01-01)

Bounds for graph energy in terms of vertex covering and clique numbers
by: Hilal A. Ganie, et al.
Published: (2019-10-01)

Rainbow vertex connection number and strong rainbow vertex connection number on slinky graph (SlnC4))
by: Afifah Farhanah Akadji, et al.
Published: (2021-07-01)

On the crossing number of join product of the discrete graph with special graphs of order five
by: Michal Staš
Published: (2020-10-01)

On the crossing numbers of join products of five graphs of order six with the discrete graph
by: Michal Staš
Published: (2020-04-01)

Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
by: Badawi Ayman, et al.
Published: (2020-12-01)

On group vertex magic graphs
by: N. Kamatchi, et al.
Published: (2020-01-01)

The Crossing Numbers of Products of Path with Graphs of Order Six
by: Klešč Marián, et al.
Published: (2013-07-01)

Optimizing ordered graph algorithms with GraphIt
by: Zhang, Yunming, et al.
Published: (2021)

Optimizing ordered graph algorithms with GraphIt
by: Zhang, Yunming, et al.
Published: (2022)

Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs
by: A Jancy Vini, et al.
Published: (2023-12-01)

Conflict-Free Vertex Connection Number At Most 3 and Size of Graphs
by: Doan Trung Duy, et al.
Published: (2021-05-01)

Effect of vertex deletion on the weak Roman domination number of a graph
by: P. Roushini Leely Pushpam, et al.
Published: (2019-08-01)

Effect of vertex deletion on the weak Roman domination number of a graph
by: P. Roushini Leely Pushpam, et al.
Published: (2019-08-01)

On the Number of α-Labeled Graphs
by: Barrientos Christian, et al.
Published: (2018-02-01)

Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five
by: Michal Staš
Published: (2019-01-01)