Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Calculating Nicole's Profit: Accounting vs. Economic Profit Analysis, Schemes and Mind Maps of Mathematics

This document provides an in-depth analysis of Nicole's pottery factory financial scenario for a microeconomics course. It includes detailed calculations of her accounting and economic profits, considering explicit costs, opportunity costs, and alternative employment options. The content covers key economic concepts such as explicit and implicit costs, opportunity cost, and profit measurement. It is designed as part of a university-level course in microeconomics, specifically course number 2103, taught by Professor [Name], focusing on beginner to intermediate economic analysis for students. The document is suitable for students studying microeconomics, economic decision-making, and firm profitability analysis in a classroom setting.

Typology: Schemes and Mind Maps

2023/2024

Uploaded on 06/08/2025

minh-bui-15
minh-bui-15 🇻🇳

2 documents

1 / 103

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Discrete Mathematics
Graph
Hà Minh Hoàng
Faculty of Data Science and Artificial Intelligence
College of Technology
National Economics University
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49
pf4a
pf4b
pf4c
pf4d
pf4e
pf4f
pf50
pf51
pf52
pf53
pf54
pf55
pf56
pf57
pf58
pf59
pf5a
pf5b
pf5c
pf5d
pf5e
pf5f
pf60
pf61
pf62
pf63
pf64

Partial preview of the text

Download Calculating Nicole's Profit: Accounting vs. Economic Profit Analysis and more Schemes and Mind Maps Mathematics in PDF only on Docsity!

Discrete Mathematics

Graph

Hà Minh Hoàng

Faculty of Data Science and Artificial Intelligence

College of Technology

National Economics University

● (^) Graphs and Their Classifications ● (^) Graph Terminologies ● (^) Graph Representations and Isomorphism ● (^) Paths and Connectivity ● Eulerian and Hamiltonian Paths ● (^) Shortest Path Problem ● (^) Planar Graphs ● (^) Graph Coloring Content

  • (^) A simple graph 𝐺=( 𝑉 𝐸, ) consists of a non-empty set 𝑉whose elements are called vertices, and a set 𝐸whose elements are called edges. Each edge is an unordered pair of distinct vertices. Classification: simple graph
  • (^) A multigraph 𝐺=( 𝑉 𝐸, ), where 𝑉 is the set of vertices and 𝐸is the set of edges, is an undirected graph that may have multiple edges connecting the same pair of vertices (called parallel edges or multiple edges).
  • (^) A simple graph is a special case of a multigraph. Classification: multigraph
  • (^) A pseudograph 𝐺=( 𝑉 𝐸, ), where 𝑉 is the set of vertices and 𝐸is the set of edges, is a graph that allows edges connecting a vertex to itself (called loops).
  • (^) A pseudograph can have multiple edges and loops. Classification: pseudograph
  • (^) A simple directed graph 𝐺=( 𝑉, A ), where 𝑉is a non-empty set whose elements are called vertices, and A is a set whose elements are called arcs, consists of ordered pairs of distinct vertices. Classification: simple directed graph

Graph terminology

Example 1. Niche overlap graph in ecology.

  • Graphs are used in many models that consider the interactions between species, e.g., the competition among species in an ecosystem can be modeled using a "niche" graph.
  • Each species is represented by a vertex. An undirected edge connects two vertices if the corresponding species compete with each other (i.e., they share the same food source).
  • From this graph, squirrels and raccoons compete with each other, while crows and shrews do not. Examples: Biological networks

Example 2. Protein interaction graph.

  • (^) The protein interaction graph of a cell is extremely large and complex.
    • (^) Yeast cells have more than 6,000 proteins, and more than 80,000 interactions
    • (^) Human cells have more than 100,000 proteins, with perhaps 1,000,000 interactions between them.
  • Additional vertices and edges are added to a protein interaction graph when new proteins and interactions between proteins are discovered.
  • The protein interaction graphs are often split into smaller graphs called modules that represent groups of proteins that are involved in a particular function of a cell.
  • Figure illustrates a module of the protein interaction graph, comprising the complex of proteins that degrade RNA in human cells. Examples: Biological networks

Example 2. Influence Graph

  • When studying the personalities of a group of people, it is observed that some individuals may influence the thoughts of others.
  • A directed graph, known as an influence graph, can be used to model this problem.
  • Each person in the group is represented by a vertex.
  • If a person represented by vertex 𝑎can influence a person represented by vertex 𝑏 , then there is a directed arc from vertex 𝑎 to vertex 𝑏. Examples: Social networks

Call graphs: Examples: Communication networks

Example 3. Citation graph

  • A citation graph is a directed graph where each node represents a scientific paper, and each directed edge points from one paper to another that it cites.
  • These graphs form the backbone of scholarly communication and offer powerful insights into the structure and evolution of scientific knowledge.
  • The Web graph Examples: Information graphs
  • (^) Airline routes
  • (^) Road networks
  • (^) Rail networks
  • (^) Shipping networks Examples: Transportation networks
  • (^) Module dependency graphs
  • (^) Precedence graph and concurrent processing Examples: Software design applications